Encoder, decoder, encoding method, and decoding method

ABSTRACT

An encoder includes circuitry and memory. The circuitry, using the memory: prohibits a first splitting method when arrangement and shapes of blocks obtained by splitting a first block multiple times by the first splitting method are identical to arrangement and shapes of blocks obtained by splitting the first block multiple times by a second splitting method different from the first splitting method, and when scan order of the blocks obtained by the first splitting method is identical to scan order of the blocks obtained by the second splitting method; and encodes the first block.

CROSS REFERENCE TO RELATED APPLICATION

The present application claims the benefit of U.S. Provisional PatentApplication No. 62/670,235 filed on May 11, 2018. The entire disclosureof the above-identified application, including the specification,drawings and claims is incorporated herein by reference in its entirety.

FIELD

The present disclosure relates to an encoder etc. that encodes videoincluding pictures.

BACKGROUND

High efficiency video coding (HEVC), also referred to as H.265, hasconventionally been present as a standard for encoding video (see NonPatent Literature (NPL) 1).

CITATION LIST Non Patent Literature

-   [NPL 1] H.265 (ISO/IEC 23008-2 HEVC)/HEVC (High Efficiency Video    Coding)

SUMMARY Technical Problem

When a block is split multiple times, encoding results have sometimesbeen obtained in which arrangement, shapes, and scan order of blocksthat have been split are identical to each other, and data for use inencoding have been redundant.

In view of this, the present disclosure provides an encoder etc. that iscapable of preventing obtainment of encoding results in whicharrangement, shapes, and scan order of blocks that have been split areidentical to each other, and reducing redundancy of data for use inencoding.

Solution to Problem

An encoder according to one aspect of the present disclosure includescircuitry and memory. The circuitry, using the memory: prohibits a firstsplitting method when arrangement and shapes of blocks obtained bysplitting a first block multiple times by the first splitting method areidentical to arrangement and shapes of blocks obtained by splitting thefirst block multiple times by a second splitting method different fromthe first splitting method, and when scan order of the blocks obtainedby the first splitting method is identical to scan order of the blocksobtained by the second splitting method; and encodes the first block.

It should be noted that these general and specific aspects may beimplemented using a system, an apparatus, a method, an integratedcircuit, a computer program, or a computer-readable non-transitoryrecording medium such as a CD-ROM, or any combination of systems,apparatuses, methods, integrated circuits, computer programs, orrecording media.

Advantageous Effects

An encoder etc. according to one aspect of the present disclosure iscapable of preventing obtainment of encoding results in whicharrangement, shapes, and scan order of blocks that have been split areidentical to each other, and reducing redundancy of data for use inencoding.

BRIEF DESCRIPTION OF DRAWINGS

These and other objects, advantages and features of the disclosure willbecome apparent from the following description thereof taken inconjunction with the accompanying drawings that illustrate a specificembodiment of the present disclosure.

FIG. 1 is a block diagram illustrating a functional configuration of anencoder according to Embodiment 1.

FIG. 2 illustrates one example of block splitting according toEmbodiment 1.

FIG. 3 is a chart indicating transform basis functions for eachtransform type.

FIG. 4A illustrates one example of a filter shape used in ALF.

FIG. 4B illustrates another example of a filter shape used in ALF.

FIG. 4C illustrates another example of a filter shape used in ALF.

FIG. 5A illustrates 67 intra prediction modes used in intra prediction.

FIG. 5B is a flow chart for illustrating an outline of a predictionimage correction process performed via OBMC processing.

FIG. 5C is a conceptual diagram for illustrating an outline of aprediction image correction process performed via OBMC processing.

FIG. 5D illustrates one example of FRUC.

FIG. 6 is for illustrating pattern matching (bilateral matching) betweentwo blocks along a motion trajectory.

FIG. 7 is for illustrating pattern matching (template matching) betweena template in the current picture and a block in a reference picture.

FIG. 8 is for illustrating a model assuming uniform linear motion.

FIG. 9A is for illustrating deriving a motion vector of each sub-blockbased on motion vectors of neighboring blocks.

FIG. 9B is for illustrating an outline of a process for deriving amotion vector via merge mode.

FIG. 9C is a conceptual diagram for illustrating an outline of DMVRprocessing.

FIG. 9D is for illustrating an outline of a prediction image generationmethod using a luminance correction process performed via LICprocessing.

FIG. 10 is a block diagram illustrating a functional configuration of adecoder according to Embodiment 1.

FIG. 11 illustrates an example of a block splitting method according toEmbodiment 1.

FIG. 12 illustrates an example of a syntax tree representing informationabout the block splitting method according to Embodiment 1 that includesoptions of splitting into two blocks, splitting into three blocks,splitting into four blocks, and no splitting.

FIG. 13A illustrates an example of scan order in a split block when acurrent block is split into horizontally and vertically symmetrical fourblocks according to Embodiment 1.

FIG. 13B illustrates an example of scan order of blocks obtained byhorizontally splitting a current block into two blocks and verticallysplitting the two blocks each into two blocks according to Embodiment 1.

FIG. 13C illustrates an example of scan order of blocks obtained byvertically splitting a current block into two blocks and horizontallysplitting the two blocks each into two blocks according to Embodiment 1.

FIG. 14 is a flow chart indicating a block splitting determinationprocess for encoding according to a first aspect of Embodiment 1.

FIG. 15 is block diagram illustrating an implementation example of theencoder according to Embodiment 1.

FIG. 16 is a flow chart indicating an operation example performed by theencoder according to Embodiment 1.

FIG. 17 is block diagram illustrating an implementation example of adecoder according to Embodiment 1.

FIG. 18 is a flow chart indicating an operation example performed by thedecoder according to Embodiment 1.

FIG. 19 illustrates an overall configuration of a content providingsystem for implementing a content distribution service.

FIG. 20 illustrates one example of an encoding structure in scalableencoding.

FIG. 21 illustrates one example of an encoding structure in scalableencoding.

FIG. 22 illustrates an example of a display screen of a web page.

FIG. 23 illustrates an example of a display screen of a web page.

FIG. 24 illustrates one example of a smartphone.

FIG. 25 is a block diagram illustrating a configuration example of asmartphone.

DESCRIPTION OF EMBODIMENTS

(Underlying Knowledge Forming Basis of the Present Disclosure)

For example, in an encoder that encodes video including pictures, ablock splitter splits a picture into coding tree units (CTUs), codingunits (CUs) obtained by recursively splitting CTUs, etc.

A picture is split into CTUs having a fixed size by raster scanning fromthe top left to the bottom right. The size of a CTU can be set to anyone of 16×16, 32×32, and 64×64 using any one of 16, 32, and 64, amultiple of 16.

A CTU is split into CUs having variable sizes, based on recursivequadtree block splitting. A quadtree is a tree data structure in whicheach board is divided into four branches. When a CTU is not split, a CTUis directly used as a CU, and the size of the CTU becomes the maximumsize of the CU. The size of a CU can be set to any one of 8×8, 16×16,32×32, and 64×64.

For example, an encoder according to one aspect of the presentdisclosure includes circuitry and memory. The circuitry, using thememory: prohibits a first splitting method when arrangement and shapesof blocks obtained by splitting a first block multiple times by thefirst splitting method are identical to arrangement and shapes of blocksobtained by splitting the first block multiple times by a secondsplitting method different from the first splitting method, and whenscan order of the blocks obtained by the first splitting method isidentical to scan order of the blocks obtained by the second splittingmethod; and encodes the first block.

With this, the encoder can prevent obtainment of encoding results inwhich arrangement, shapes, and scan order of blocks that have been splitare identical to each other. As a result, the encoder can reduceredundancy of data for use in encoding without degrading encodingperformance. In addition, the encoder can reduce an amount of processingrelating to the encoding, and an amount of encoding.

Moreover, in the encoder according to one aspect of the presentdisclosure, the first splitting method prohibited is a splitting methodof vertically splitting, when the first block is horizontally split intotwo blocks and an upper block of the two blocks is further verticallysplit into other two blocks, a lower block of the two blocks into twoblocks.

With this, the encoder can prohibit vertical splitting into two blocksafter horizontal splitting into two blocks, which result in arrangement,shapes, and scan order of the blocks obtained by the splitting that areidentical to those resulting from splitting into four blocks. As aresult, the encoder can reduce redundancy of data for use in encodingwithout degrading encoding performance. In addition, the encoder canreduce an amount of processing relating to the encoding, and an amountof encoding.

Moreover, for example, in the encoder according to one aspect of thepresent disclosure, the circuitry avoids encoding a signal forspecifying the first splitting method prohibited.

With this, the encoder can reduce an amount of encoding by avoidingencoding a signal for specifying a splitting method having lowfeasibility. As a result, the encoder can reduce redundancy of data foruse in encoding without degrading encoding performance. In addition, theencoder can reduce an amount of processing relating to the encoding, andan amount of encoding.

Moreover, in the encoder according to one aspect of the presentdisclosure, the signal specifies a direction along which, when the firstblock is horizontally split into two blocks and an upper block of thetwo blocks is further vertically split into other two blocks, a lowerblock of the two blocks is split.

With this, the encoder can reduce an amount of encoding by avoidencoding a signal for specifying vertical splitting into two blocksafter horizontal splitting into two blocks, which result in arrangement,shapes, and scan order of the blocks obtained by the splitting that areidentical to those resulting from splitting into four blocks. As aresult, the encoder can reduce redundancy of data for use in encodingwithout degrading encoding performance. In addition, the encoder canreduce an amount of processing relating to the encoding, and an amountof encoding.

Moreover, for example, an decoder according to one aspect of the presentdisclosure includes circuitry and memory. The circuitry, using thememory: prohibits a first splitting method when arrangement and shapesof blocks obtained by splitting a first block multiple times by thefirst splitting method are identical to arrangement and shapes of blocksobtained by splitting the first block multiple times by a secondsplitting method different from the first splitting method, and whenscan order of the blocks obtained by the first splitting method isidentical to scan order of the blocks obtained by the second splittingmethod; and decodes the first block.

With this, the decoder can prevent obtainment of decoding results inwhich arrangement, shapes, and scan order of blocks that have been splitare identical to each other. As a result, the decoder can reduceredundancy of data for use in decoding without degrading decodingperformance. In addition, the decoder can reduce an amount of processingrelating to the decoding, and an amount of decoding.

Moreover, in the decoder according to one aspect of the presentdisclosure, the first splitting method prohibited is a splitting methodof vertically splitting, when the first block is horizontally split intotwo blocks and an upper block of the two blocks is further verticallysplit into other two blocks, a lower block of the two blocks into twoblocks.

With this, the decoder can prohibit vertical splitting into two blocksafter horizontal splitting into two blocks, which result in arrangement,shapes, and scan order of the blocks obtained by the splitting that areidentical to those resulting from splitting into four blocks. As aresult, the decoder can reduce redundancy of data for use in decodingwithout degrading decoding performance. In addition, the decoder canreduce an amount of processing relating to the decoding, and an amountof decoding.

Moreover, for example, in the decoder according to one aspect of thepresent disclosure, the circuitry avoids decoding a signal forspecifying the first splitting method prohibited from a bitstream.

With this, the decoder can reduce an amount of decoding by avoidingdecoding a signal for specifying a splitting method having lowfeasibility. As a result, the decoder can reduce redundancy of data foruse in decoding without degrading decoding performance. In addition, thedecoder can reduce an amount of processing relating to the decoding, andan amount of decoding.

Moreover, in the decoder according to one aspect of the presentdisclosure, the signal specifies a direction along which, when the firstblock is horizontally split into two blocks and an upper block of thetwo blocks is further vertically split into other two blocks, a lowerblock of the two blocks is split.

With this, the decoder can reduce an amount of decoding by avoidingdecoding a signal for specifying vertical splitting into two blocksafter horizontal splitting into two blocks, which result in arrangement,shapes, and scan order of the blocks obtained by the splitting that areidentical to those resulting from splitting into four blocks. As aresult, the decoder can reduce redundancy of data for use in decodingwithout degrading decoding performance. In addition, the decoder canreduce an amount of processing relating to the decoding, and an amountof decoding.

Moreover, for example, an encoding method according to one aspect of thepresent disclosure includes: prohibiting a first splitting method whenarrangement and shapes of blocks obtained by splitting a first blockmultiple times by the first splitting method are identical toarrangement and shapes of blocks obtained by splitting the first blockmultiple times by a second splitting method different from the firstsplitting method, and when scan order of the blocks obtained by thefirst splitting method is identical to scan order of the blocks obtainedby the second splitting method; and encoding the first block.

With this, the encoding method can prevent obtainment of encodingresults in which arrangement, shapes, and scan order of blocks that havebeen split are identical to each other. As a result, the encoding methodcan reduce redundancy of data for use in encoding without degradingencoding performance. In addition, the encoding method can reduce anamount of processing relating to the encoding, and an amount ofencoding.

Moreover, for example, an decoding method according to one aspect of thepresent disclosure includes: prohibiting a first splitting method whenarrangement and shapes of blocks obtained by splitting a first blockmultiple times by the first splitting method are identical toarrangement and shapes of blocks obtained by splitting the first blockmultiple times by a second splitting method different from the firstsplitting method, and when scan order of the blocks obtained by thefirst splitting method is identical to scan order of the blocks obtainedby the second splitting method; and decoding the first block.

With this, the decoding method can prevent obtainment of decodingresults in which arrangement, shapes, and scan order of blocks that havebeen split are identical to each other. As a result, the decoding methodcan reduce redundancy of data for use in decoding without degradingdecoding performance. In addition, the decoding method can reduce anamount of processing relating to the decoding, and an amount ofdecoding.

Moreover, for example, the encoder according to one aspect of thepresent disclosure may include a splitter, an intra predictor, an interpredictor, a loop filter, a transformer, a quantizer, and an entropyencoder.

The splitter may split a picture into blocks. The intra predictor mayperform intra prediction on a block among the blocks. The interpredictor may perform inter prediction on the block. The transformer maytransform prediction errors between a prediction image obtained by theintra prediction or the inter prediction and an original image, togenerate transform coefficients. The quantizer may quantize thetransform coefficients to generate quantized coefficients. The entropyencoder may encode the quantized coefficients to generate an encodedbitstream. The loop filter may apply a filter to a reconstructed imageof the block.

Moreover, for example, the encoder may be an encoder that encodes videoincluding pictures.

The splitter may prohibit a first splitting method when arrangement andshapes of blocks obtained by splitting a first block multiple times bythe first splitting method are identical to arrangement and shapes ofblocks obtained by splitting the first block multiple times by a secondsplitting method different from the first splitting method, and whenscan order of the blocks obtained by the first splitting method isidentical to scan order of the blocks obtained by the second splittingmethod; and encode the first block.

Moreover, for example, the decoder according to one aspect of thepresent disclosure may include an entropy decoder, an inverse quantizer,an inverse transformer, an intra predictor, an inter predictor, and aloop filter.

The entropy decoder may decode quantized coefficients of a block in apicture, from an encoded bitstream. The inverse quantizer may inversequantize the quantized coefficients to obtain transform coefficients.The inverse transformer may inverse transform the transform coefficientsto obtain prediction errors. The intra predictor may perform intraprediction on the block. The inter predictor may perform interprediction on the block. The loop filter may apply a filter to areconstructed image generated using a prediction image obtained by theintra prediction or the inter prediction and the prediction errors.

Moreover, for example, the decoder may be a decoder that decodes videoincluding pictures.

The decoder may further include a splitter that splits a picture intoblocks.

The splitter may prohibit a first splitting method when arrangement andshapes of blocks obtained by splitting a first block multiple times bythe first splitting method are identical to arrangement and shapes ofblocks obtained by splitting the first block multiple times by a secondsplitting method different from the first splitting method, and whenscan order of the blocks obtained by the first splitting method isidentical to scan order of the blocks obtained by the second splittingmethod; and decode the first block.

Furthermore, these general and specific aspects may be implemented usinga system, an apparatus, a method, an integrated circuit, a computerprogram, or a computer-readable non-transitory recording medium such asa CD-ROM, or any combination of systems, apparatuses, methods,integrated circuits, computer programs, or recording media.

Hereinafter, embodiments will be described with reference to thedrawings.

Note that the embodiments described below each show a general orspecific example.

The numerical values, shapes, materials, structural components, thearrangement and connection of the structural components, steps, order ofthe steps, etc., indicated in the following embodiments are mereexamples, and therefore are not intended to limit the scope of theclaims. Therefore, among the structural components in the followingembodiments, those not recited in any of the independent claims definingthe most generic inventive concepts are described as optional structuralcomponents.

Embodiment 1

First, an outline of Embodiment 1 will be presented. Embodiment 1 is oneexample of an encoder and a decoder to which the processes and/orconfigurations presented in subsequent description of aspects of thepresent disclosure are applicable. Note that Embodiment 1 is merely oneexample of an encoder and a decoder to which the processes and/orconfigurations presented in the description of aspects of the presentdisclosure are applicable. The processes and/or configurations presentedin the description of aspects of the present disclosure can also beimplemented in an encoder and a decoder different from those accordingto Embodiment 1.

When the processes and/or configurations presented in the description ofaspects of the present disclosure are applied to Embodiment 1, forexample, any of the following may be performed.

(1) _(regar)ding the encoder or the decoder according to Embodiment 1,among constituent elements included in the encoder or the decoderaccording to Embodiment 1, substituting a constituent elementcorresponding to a constituent element presented in the description ofaspects of the present disclosure with a constituent element presentedin the description of aspects of the present disclosure;

(2) regarding the encoder or the decoder according to Embodiment 1,implementing discretionary changes to functions or implemented processesperformed by one or more constituent elements included in the encoder orthe decoder according to Embodiment 1, such as addition, substitution,or removal, etc., of such functions or implemented processes, thensubstituting a constituent element corresponding to a constituentelement presented in the description of aspects of the presentdisclosure with a constituent element presented in the description ofaspects of the present disclosure;

(3) regarding the method implemented by the encoder or the decoderaccording to Embodiment 1, implementing discretionary changes such asaddition of processes and/or substitution, removal of one or more of theprocesses included in the method, and then substituting a processescorresponding to a process presented in the description of aspects ofthe present disclosure with a process presented in the description ofaspects of the present disclosure;

(4) combining one or more constituent elements included in the encoderor the decoder according to Embodiment 1 with a constituent elementpresented in the description of aspects of the present disclosure, aconstituent element including one or more functions included in aconstituent element presented in the description of aspects of thepresent disclosure, or a constituent element that implements one or moreprocesses implemented by a constituent element presented in thedescription of aspects of the present disclosure;

(5) _(com)bining a constituent element including one or more functionsincluded in one or more constituent elements included in the encoder orthe decoder according to Embodiment 1, or a constituent element thatimplements one or more processes implemented by one or more constituentelements included in the encoder or the decoder according to Embodiment1 with a constituent element presented in the description of aspects ofthe present disclosure, a constituent element including one or morefunctions included in a constituent element presented in the descriptionof aspects of the present disclosure, or a constituent element thatimplements one or more processes implemented by a constituent elementpresented in the description of aspects of the present disclosure;

(6) regarding the method implemented by the encoder or the decoderaccording to Embodiment 1, among processes included in the method,substituting a process corresponding to a process presented in thedescription of aspects of the present disclosure with a processpresented in the description of aspects of the present disclosure; and

(7) combining one or more processes included in the method implementedby the encoder or the decoder according to Embodiment 1 with a processpresented in the description of aspects of the present disclosure.

Note that the implementation of the processes and/or configurationspresented in the description of aspects of the present disclosure is notlimited to the above examples. For example, the processes and/orconfigurations presented in the description of aspects of the presentdisclosure may be implemented in a device used for a purpose differentfrom the moving picture/picture encoder or the moving picture/picturedecoder disclosed in Embodiment 1. Moreover, the processes and/orconfigurations presented in the description of aspects of the presentdisclosure may be independently implemented. Moreover, processes and/orconfigurations described in different aspects may be combined.

[Encoder Outline]

First, the encoder according to Embodiment 1 will be outlined. FIG. 1 isa block diagram illustrating a functional configuration of encoder 100according to Embodiment 1. Encoder 100 is a moving picture/pictureencoder that encodes a moving picture/picture block by block.

As illustrated in FIG. 1, encoder 100 is a device that encodes a pictureblock by block, and includes splitter 102, subtractor 104, transformer106, quantizer 108, entropy encoder 110, inverse quantizer 112, inversetransformer 114, adder 116, block memory 118, loop filter 120, framememory 122, intra predictor 124, inter predictor 126, and predictioncontroller 128.

Encoder 100 is realized as, for example, a generic processor and memory.In this case, when a software program stored in the memory is executedby the processor, the processor functions as splitter 102, subtractor104, transformer 106, quantizer 108, entropy encoder 110, inversequantizer 112, inverse transformer 114, adder 116, loop filter 120,intra predictor 124, inter predictor 126, and prediction controller 128.Alternatively, encoder 100 may be realized as one or more dedicatedelectronic circuits corresponding to splitter 102, subtractor 104,transformer 106, quantizer 108, entropy encoder 110, inverse quantizer112, inverse transformer 114, adder 116, loop filter 120, intrapredictor 124, inter predictor 126, and prediction controller 128.

Hereinafter, each constituent element included in encoder 100 will bedescribed.

[Splitter]

Splitter 102 splits each picture included in an input moving pictureinto blocks, and outputs each block to subtractor 104. For example,splitter 102 first splits a picture into blocks of a fixed size (forexample, 128×128). The fixed size block is also referred to as codingtree unit (CTU). Splitter 102 then splits each fixed size block intoblocks of variable sizes (for example, 64×64 or smaller), based onrecursive quadtree and/or binary tree block splitting. The variable sizeblock is also referred to as a coding unit (CU), a prediction unit (PU),or a transform unit (TU). Note that in the present embodiment, there isno need to differentiate between CU, PU, and TU; all or some of theblocks in a picture may be processed per CU, PU, or TU.

FIG. 2 illustrates one example of block splitting according toEmbodiment 1. In FIG. 2, the solid lines represent block boundaries ofblocks split by quadtree block splitting, and the dashed lines representblock boundaries of blocks split by binary tree block splitting.

Here, block 10 is a square 128×128 pixel block (128×128 block). This128×128 block 10 is first split into four square 64×64 blocks (quadtreeblock splitting).

The top left 64×64 block is further vertically split into two rectangle32×64 blocks, and the left 32×64 block is further vertically split intotwo rectangle 16×64 blocks (binary tree block splitting). As a result,the top left 64×64 block is split into two 16×64 blocks 11 and 12 andone 32×64 block 13.

The top right 64×64 block is horizontally split into two rectangle 64×32blocks 14 and 15 (binary tree block splitting).

The bottom left 64×64 block is first split into four square 32×32 blocks(quadtree block splitting). The top left block and the bottom rightblock among the four 32×32 blocks are further split. The top left 32×32block is vertically split into two rectangle 16×32 blocks, and the right16×32 block is further horizontally split into two 16×16 blocks (binarytree block splitting). The bottom right 32×32 block is horizontallysplit into two 32×16 blocks (binary tree block splitting). As a result,the bottom left 64×64 block is split into 16×32 block 16, two 16×16blocks 17 and 18, two 32×32 blocks 19 and 20, and two 32×16 blocks 21and 22.

The bottom right 64×64 block 23 is not split.

As described above, in FIG. 2, block 10 is split into 13 variable sizeblocks 11 through 23 based on recursive quadtree and binary tree blocksplitting. This type of splitting is also referred to as quadtree plusbinary tree (QTBT) splitting.

Note that in FIG. 2, one block is split into four or two blocks(quadtree or binary tree block splitting), but splitting is not limitedto this example. For example, one block may be split into three blocks(ternary block splitting). Splitting including such ternary blocksplitting is also referred to as multi-type tree (MBT) splitting.

[Subtractor]

Subtractor 104 subtracts a prediction signal (prediction sample) from anoriginal signal (original sample) per block split by splitter 102. Inother words, subtractor 104 calculates prediction errors (also referredto as residuals) of a block to be encoded (hereinafter referred to as acurrent block). Subtractor 104 then outputs the calculated predictionerrors to transformer 106.

The original signal is a signal input into encoder 100, and is a signalrepresenting an image for each picture included in a moving picture (forexample, a luma signal and two chroma signals). Hereinafter, a signalrepresenting an image is also referred to as a sample.

[Transformer]

Transformer 106 transforms spatial domain prediction errors intofrequency domain transform coefficients, and outputs the transformcoefficients to quantizer 108. More specifically, transformer 106applies, for example, a predefined discrete cosine transform (DCT) ordiscrete sine transform (DST) to spatial domain prediction errors.

Note that transformer 106 may adaptively select a transform type fromamong a plurality of transform types, and transform prediction errorsinto transform coefficients by using a transform basis functioncorresponding to the selected transform type. This sort of transform isalso referred to as explicit multiple core transform (EMT) or adaptivemultiple transform (AMT).

The transform types include, for example, DCT-II, DCT-V, DCT-VIII,DST-I, and DST-VII. FIG. 3 is a chart indicating transform basisfunctions for each transform type. In FIG. 3, N indicates the number ofinput pixels. For example, selection of a transform type from among theplurality of transform types may depend on the prediction type (intraprediction and inter prediction), and may depend on intra predictionmode.

Information indicating whether to apply such EMT or AMT (referred to as,for example, an AMT flag) and information indicating the selectedtransform type is signalled at the CU level. Note that the signaling ofsuch information need not be performed at the CU level, and may beperformed at another level (for example, at the sequence level, picturelevel, slice level, tile level, or CTU level).

Moreover, transformer 106 may apply a secondary transform to thetransform coefficients (transform result). Such a secondary transform isalso referred to as adaptive secondary transform (AST) or non-separablesecondary transform (NSST). For example, transformer 106 applies asecondary transform to each sub-block (for example, each 4×4 sub-block)included in the block of the transform coefficients corresponding to theintra prediction errors. Information indicating whether to apply NSSTand information related to the transform matrix used in NSST aresignalled at the CU level. Note that the signaling of such informationneed not be performed at the CU level, and may be performed at anotherlevel (for example, at the sequence level, picture level, slice level,tile level, or CTU level).

Here, a separable transform is a method in which a transform isperformed a plurality of times by separately performing a transform foreach direction according to the number of dimensions input. Anon-separable transform is a method of performing a collective transformin which two or more dimensions in a multidimensional input arecollectively regarded as a single dimension.

In one example of a non-separable transform, when the input is a 4×4block, the 4×4 block is regarded as a single array including 16constituent elements, and the transform applies a 16×16 transform matrixto the array.

Moreover, similar to above, after an input 4×4 block is regarded as asingle array including 16 constituent elements, a transform thatperforms a plurality of Givens rotations on the array (i.e., aHypercube-Givens Transform) is also one example of a non-separabletransform.

[Quantizer]

Quantizer 108 quantizes the transform coefficients output fromtransformer 106. More specifically, quantizer 108 scans, in apredetermined scanning order, the transform coefficients of the currentblock, and quantizes the scanned transform coefficients based onquantization parameters (QP) corresponding to the transformcoefficients. Quantizer 108 then outputs the quantized transformcoefficients (hereinafter referred to as quantized coefficients) of thecurrent block to entropy encoder 110 and inverse quantizer 112.

A predetermined order is an order for quantizing/inverse quantizingtransform coefficients. For example, a predetermined scanning order isdefined as ascending order of frequency (from low to high frequency) ordescending order of frequency (from high to low frequency).

A quantization parameter is a parameter defining a quantization stepsize (quantization width). For example, if the value of the quantizationparameter increases, the quantization step size also increases. In otherwords, if the value of the quantization parameter increases, thequantization error increases.

[Entropy Encoder]

Entropy encoder 110 generates an encoded signal (encoded bitstream) byvariable length encoding quantized coefficients, which are inputs fromquantizer 108. More specifically, entropy encoder 110, for example,binarizes quantized coefficients and arithmetic encodes the binarysignal.

[Inverse Quantizer]

Inverse quantizer 112 inverse quantizes quantized coefficients, whichare inputs from quantizer 108. More specifically, inverse quantizer 112inverse quantizes, in a predetermined scanning order, quantizedcoefficients of the current block. Inverse quantizer 112 then outputsthe inverse quantized transform coefficients of the current block toinverse transformer 114.

[Inverse Transformer]

Inverse transformer 114 restores prediction errors by inversetransforming transform coefficients, which are inputs from inversequantizer 112. More specifically, inverse transformer 114 restores theprediction errors of the current block by applying an inverse transformcorresponding to the transform applied by transformer 106 on thetransform coefficients. Inverse transformer 114 then outputs therestored prediction errors to adder 116.

Note that since information is lost in quantization, the restoredprediction errors do not match the prediction errors calculated bysubtractor 104. In other words, the restored prediction errors includequantization errors.

[Adder]

Adder 116 reconstructs the current block by summing prediction errors,which are inputs from inverse transformer 114, and prediction samples,which are inputs from prediction controller 128. Adder 116 then outputsthe reconstructed block to block memory 118 and loop filter 120. Areconstructed block is also referred to as a local decoded block.

[Block Memory]

Block memory 118 is storage for storing blocks in a picture to beencoded (hereinafter referred to as a current picture) for reference inintra prediction. More specifically, block memory 118 storesreconstructed blocks output from adder 116.

[Loop Filter]

Loop filter 120 applies a loop filter to blocks reconstructed by adder116, and outputs the filtered reconstructed blocks to frame memory 122.A loop filter is a filter used in an encoding loop (in-loop filter), andincludes, for example, a deblocking filter (DF), a sample adaptiveoffset (SAO), and an adaptive loop filter (ALF).

In ALF, a least square error filter for removing compression artifactsis applied. For example, one filter from among a plurality of filters isselected for each 2×2 sub-block in the current block based on directionand activity of local gradients, and is applied.

More specifically, first, each sub-block (for example, each 2×2sub-block) is categorized into one out of a plurality of classes (forexample, 15 or 25 classes). The classification of the sub-block is basedon gradient directionality and activity. For example, classificationindex C is derived based on gradient directionality D (for example, 0 to2 or 0 to 4) and gradient activity A (for example, 0 to 4) (for example,C=5D+A). Then, based on classification index C, each sub-block iscategorized into one out of a plurality of classes (for example, 15 or25 classes).

For example, gradient directionality D is calculated by comparinggradients of a plurality of directions (for example, the horizontal,vertical, and two diagonal directions). Moreover, for example, gradientactivity A is calculated by summing gradients of a plurality ofdirections and quantizing the sum.

The filter to be used for each sub-block is determined from among theplurality of filters based on the result of such categorization.

The filter shape to be used in ALF is, for example, a circular symmetricfilter shape. FIG. 4A through FIG. 4C illustrate examples of filtershapes used in ALF. FIG. 4A illustrates a 5×5 diamond shape filter, FIG.4B illustrates a 7×7 diamond shape filter, and FIG. 4C illustrates a 9×9diamond shape filter. Information indicating the filter shape issignalled at the picture level. Note that the signaling of informationindicating the filter shape need not be performed at the picture level,and may be performed at another level (for example, at the sequencelevel, slice level, tile level, CTU level, or CU level).

The enabling or disabling of ALF is determined at the picture level orCU level. For example, for luma, the decision to apply ALF or not isdone at the CU level, and for chroma, the decision to apply ALF or notis done at the picture level. Information indicating whether ALF isenabled or disabled is signalled at the picture level or CU level. Notethat the signaling of information indicating whether ALF is enabled ordisabled need not be performed at the picture level or CU level, and maybe performed at another level (for example, at the sequence level, slicelevel, tile level, or CTU level).

The coefficients set for the plurality of selectable filters (forexample, 15 or 25 filters) is signalled at the picture level. Note thatthe signaling of the coefficients set need not be performed at thepicture level, and may be performed at another level (for example, atthe sequence level, slice level, tile level, CTU level, CU level, orsub-block level).

[Frame Memory]

Frame memory 122 is storage for storing reference pictures used in interprediction, and is also referred to as a frame buffer. Morespecifically, frame memory 122 stores reconstructed blocks filtered byloop filter 120.

[Intra Predictor]

Intra predictor 124 generates a prediction signal (intra predictionsignal) by intra predicting the current block with reference to a blockor blocks in the current picture and stored in block memory 118 (alsoreferred to as intra frame prediction). More specifically, intrapredictor 124 generates an intra prediction signal by intra predictionwith reference to samples (for example, luma and/or chroma values) of ablock or blocks neighboring the current block, and then outputs theintra prediction signal to prediction controller 128.

For example, intra predictor 124 performs intra prediction by using onemode from among a plurality of predefined intra prediction modes. Theintra prediction modes include one or more non-directional predictionmodes and a plurality of directional prediction modes.

The one or more non-directional prediction modes include, for example,planar prediction mode and DC prediction mode defined in theH.265/high-efficiency video coding (HEVC) standard (see NPTL 1).

The plurality of directional prediction modes include, for example, the33 directional prediction modes defined in the H.265/HEVC standard. Notethat the plurality of directional prediction modes may further include32 directional prediction modes in addition to the 33 directionalprediction modes (for a total of 65 directional prediction modes). FIG.5A illustrates 67 intra prediction modes used in intra prediction (twonon-directional prediction modes and 65 directional prediction modes).The solid arrows represent the 33 directions defined in the H.265/HEVCstandard, and the dashed arrows represent the additional 32 directions.

Note that a luma block may be referenced in chroma block intraprediction. In other words, a chroma component of the current block maybe predicted based on a luma component of the current block. Such intraprediction is also referred to as cross-component linear model (CCLM)prediction. Such a chroma block intra prediction mode that references aluma block (referred to as, for example, CCLM mode) may be added as oneof the chroma block intra prediction modes.

Intra predictor 124 may correct post-intra-prediction pixel values basedon horizontal/vertical reference pixel gradients. Intra predictionaccompanied by this sort of correcting is also referred to as positiondependent intra prediction combination (PDPC). Information indicatingwhether to apply PDPC or not (referred to as, for example, a PDPC flag)is, for example, signalled at the CU level. Note that the signaling ofthis information need not be performed at the CU level, and may beperformed at another level (for example, on the sequence level, picturelevel, slice level, tile level, or CTU level).

[Inter Predictor]

Inter predictor 126 generates a prediction signal (inter predictionsignal) by inter predicting the current block with reference to a blockor blocks in a reference picture, which is different from the currentpicture and is stored in frame memory 122 (also referred to as interframe prediction). Inter prediction is performed per current block orper sub-block (for example, per 4×4 block) in the current block. Forexample, inter predictor 126 performs motion estimation in a referencepicture for the current block or sub-block. Inter predictor 126 thengenerates an inter prediction signal of the current block or sub-blockby motion compensation by using motion information (for example, amotion vector) obtained from motion estimation. Inter predictor 126 thenoutputs the generated inter prediction signal to prediction controller128.

The motion information used in motion compensation is signalled. Amotion vector predictor may be used for the signaling of the motionvector. In other words, the difference between the motion vector and themotion vector predictor may be signalled.

Note that the inter prediction signal may be generated using motioninformation for a neighboring block in addition to motion informationfor the current block obtained from motion estimation. Morespecifically, the inter prediction signal may be generated per sub-blockin the current block by calculating a weighted sum of a predictionsignal based on motion information obtained from motion estimation and aprediction signal based on motion information for a neighboring block.Such inter prediction (motion compensation) is also referred to asoverlapped block motion compensation (OBMC).

In such an OBMC mode, information indicating sub-block size for OBMC(referred to as, for example, OBMC block size) is signalled at thesequence level. Moreover, information indicating whether to apply theOBMC mode or not (referred to as, for example, an OBMC flag) issignalled at the CU level. Note that the signaling of such informationneed not be performed at the sequence level and CU level, and may beperformed at another level (for example, at the picture level, slicelevel, tile level, CTU level, or sub-block level).

Hereinafter, the OBMC mode will be described in further detail. FIG. 5Bis a flowchart and FIG. 5C is a conceptual diagram for illustrating anoutline of a prediction image correction process performed via OBMCprocessing.

First, a prediction image (Pred) is obtained through typical motioncompensation using a motion vector (MV) assigned to the current block.

Next, a prediction image (Pred_L) is obtained by applying a motionvector (MV_L) of the encoded neighboring left block to the currentblock, and a first pass of the correction of the prediction image ismade by superimposing the prediction image and Pred_L.

Similarly, a prediction image (Pred_U) is obtained by applying a motionvector (MV_U) of the encoded neighboring upper block to the currentblock, and a second pass of the correction of the prediction image ismade by superimposing the prediction image resulting from the first passand Pred_U. The result of the second pass is the final prediction image.

Note that the above example is of a two-pass correction method using theneighboring left and upper blocks, but the method may be a three-pass orhigher correction method that also uses the neighboring right and/orlower block.

Note that the region subject to superimposition may be the entire pixelregion of the block, and, alternatively, may be a partial block boundaryregion.

Note that here, the prediction image correction process is described asbeing based on a single reference picture, but the same applies when aprediction image is corrected based on a plurality of referencepictures. In such a case, after corrected prediction images resultingfrom performing correction based on each of the reference pictures areobtained, the obtained corrected prediction images are furthersuperimposed to obtain the final prediction image.

Note that the unit of the current block may be a prediction block and,alternatively, may be a sub-block obtained by further dividing theprediction block.

One example of a method for determining whether to implement OBMCprocessing is by using an obmc_flag, which is a signal that indicateswhether to implement OBMC processing. As one specific example, theencoder determines whether the current block belongs to a regionincluding complicated motion. The encoder sets the obmc_flag to a valueof “1” when the block belongs to a region including complicated motionand implements OBMC processing when encoding, and sets the obmc_flag toa value of “0” when the block does not belong to a region includingcomplication motion and encodes without implementing OBMC processing.The decoder switches between implementing OBMC processing or not bydecoding the obmc_flag written in the stream and performing the decodingin accordance with the flag value.

Note that the motion information may be derived on the decoder sidewithout being signalled. For example, a merge mode defined in theH.265/HEVC standard may be used. Moreover, for example, the motioninformation may be derived by performing motion estimation on thedecoder side. In this case, motion estimation is performed without usingthe pixel values of the current block.

Here, a mode for performing motion estimation on the decoder side willbe described. A mode for performing motion estimation on the decoderside is also referred to as pattern matched motion vector derivation(PMMVD) mode or frame rate up-conversion (FRUC) mode.

One example of FRUC processing is illustrated in FIG. 5D. First, acandidate list (a candidate list may be a merge list) of candidates eachincluding a motion vector predictor is generated with reference tomotion vectors of encoded blocks that spatially or temporally neighborthe current block. Next, the best candidate MV is selected from among aplurality of candidate MVs registered in the candidate list. Forexample, evaluation values for the candidates included in the candidatelist are calculated and one candidate is selected based on thecalculated evaluation values.

Next, a motion vector for the current block is derived from the motionvector of the selected candidate. More specifically, for example, themotion vector for the current block is calculated as the motion vectorof the selected candidate (best candidate MV), as-is. Alternatively, themotion vector for the current block may be derived by pattern matchingperformed in the vicinity of a position in a reference picturecorresponding to the motion vector of the selected candidate. In otherwords, when the vicinity of the best candidate MV is searched via thesame method and an MV having a better evaluation value is found, thebest candidate MV may be updated to the MV having the better evaluationvalue, and the MV having the better evaluation value may be used as thefinal MV for the current block. Note that a configuration in which thisprocessing is not implemented is also acceptable.

The same processes may be performed in cases in which the processing isperformed in units of sub-blocks.

Note that an evaluation value is calculated by calculating thedifference in the reconstructed image by pattern matching performedbetween a region in a reference picture corresponding to a motion vectorand a predetermined region. Note that the evaluation value may becalculated by using some other information in addition to thedifference.

The pattern matching used is either first pattern matching or secondpattern matching. First pattern matching and second pattern matching arealso referred to as bilateral matching and template matching,respectively.

In the first pattern matching, pattern matching is performed between twoblocks along the motion trajectory of the current block in two differentreference pictures. Therefore, in the first pattern matching, a regionin another reference picture conforming to the motion trajectory of thecurrent block is used as the predetermined region for theabove-described calculation of the candidate evaluation value.

FIG. 6 is for illustrating one example of pattern matching (bilateralmatching) between two blocks along a motion trajectory. As illustratedin FIG. 6, in the first pattern matching, two motion vectors (MV0, MV1)are derived by finding the best match between two blocks along themotion trajectory of the current block (Cur block) in two differentreference pictures (Ref0, Ref1). More specifically, a difference between(i) a reconstructed image in a specified position in a first encodedreference picture (Ref0) specified by a candidate MV and (ii) areconstructed picture in a specified position in a second encodedreference picture (Ref1) specified by a symmetrical MV scaled at adisplay time interval of the candidate MV may be derived, and theevaluation value for the current block may be calculated by using thederived difference. The candidate MV having the best evaluation valueamong the plurality of candidate MVs may be selected as the final MV.

Under the assumption of continuous motion trajectory, the motion vectors(MV0, MV1) pointing to the two reference blocks shall be proportional tothe temporal distances (TD0, TD1) between the current picture (Cur Pic)and the two reference pictures (Ref0, Ref1). For example, when thecurrent picture is temporally between the two reference pictures and thetemporal distance from the current picture to the two reference picturesis the same, the first pattern matching derives a mirror basedbi-directional motion vector.

In the second pattern matching, pattern matching is performed between atemplate in the current picture (blocks neighboring the current block inthe current picture (for example, the top and/or left neighboringblocks)) and a block in a reference picture. Therefore, in the secondpattern matching, a block neighboring the current block in the currentpicture is used as the predetermined region for the above-describedcalculation of the candidate evaluation value.

FIG. 7 is for illustrating one example of pattern matching (templatematching) between a template in the current picture and a block in areference picture. As illustrated in FIG. 7, in the second patternmatching, a motion vector of the current block is derived by searching areference picture (Ref0) to find the block that best matches neighboringblocks of the current block (Cur block) in the current picture (CurPic). More specifically, a difference between (i) a reconstructed imageof an encoded region that is both or one of the neighboring left andneighboring upper region and (ii) a reconstructed picture in the sameposition in an encoded reference picture (RefO) specified by a candidateMV may be derived, and the evaluation value for the current block may becalculated by using the derived difference. The candidate MV having thebest evaluation value among the plurality of candidate MVs may beselected as the best candidate MV.

Information indicating whether to apply the FRUC mode or not (referredto as, for example, a FRUC flag) is signalled at the CU level. Moreover,when the FRUC mode is applied (for example, when the FRUC flag is set totrue), information indicating the pattern matching method (first patternmatching or second pattern matching) is signalled at the CU level. Notethat the signaling of such information need not be performed at the CUlevel, and may be performed at another level (for example, at thesequence level, picture level, slice level, tile level, CTU level, orsub-block level).

Here, a mode for deriving a motion vector based on a model assuminguniform linear motion will be described. This mode is also referred toas a bi-directional optical flow (BIO) mode.

FIG. 8 is for illustrating a model assuming uniform linear motion. InFIG. 8, (v_(x), v_(y)) denotes a velocity vector, and τ₀ and τ₁ denotetemporal distances between the current picture (Cur Pic) and tworeference pictures (Ref₀, Ref₁). (MVx₀, MVy₀) denotes a motion vectorcorresponding to reference picture Ref0, and (MVx₁, MVy₁) denotes amotion vector corresponding to reference picture Ref₁.

Here, under the assumption of uniform linear motion exhibited byvelocity vector (v_(x), v_(y)), (MVx₀, MVy₀) and (MVx₁, MVy₁) arerepresented as (v_(x)τ₀, vyτ0) and (−v_(x)τ₁, −v_(y)τ₁), respectively,and the following optical flow equation is given.

MATH. 1

∂I ^((k)) /∂t+v _(x) ∂I ^((k)) /∂x+v _(y) ∂I ^((k)) /∂y=0.   (1)

Here, I^((k)) denotes a luma value from reference picture k (k=0, 1)after motion compensation. This optical flow equation shows that the sumof (i) the time derivative of the luma value, (ii) the product of thehorizontal velocity and the horizontal component of the spatial gradientof a reference picture, and (iii) the product of the vertical velocityand the vertical component of the spatial gradient of a referencepicture is equal to zero. A motion vector of each block obtained from,for example, a merge list is corrected pixel by pixel based on acombination of the optical flow equation and Hermite interpolation.

Note that a motion vector may be derived on the decoder side using amethod other than deriving a motion vector based on a model assuminguniform linear motion. For example, a motion vector may be derived foreach sub-block based on motion vectors of neighboring blocks.

Here, a mode in which a motion vector is derived for each sub-blockbased on motion vectors of neighboring blocks will be described. Thismode is also referred to as affine motion compensation prediction mode.

FIG. 9A is for illustrating deriving a motion vector of each sub-blockbased on motion vectors of neighboring blocks. In FIG. 9A, the currentblock includes 16 4×4 sub-blocks. Here, motion vector v₀ of the top leftcorner control point in the current block is derived based on motionvectors of neighboring sub-blocks, and motion vector v₁ of the top rightcorner control point in the current block is derived based on motionvectors of neighboring blocks. Then, using the two motion vectors v₀ andv₁, the motion vector (v_(x), v_(y)) of each sub-block in the currentblock is derived using Equation 2 below.

MATH.  2 $\begin{matrix}\left\{ \begin{matrix}{v_{x} = {{\frac{\left( {v_{1x} - v_{0x}} \right)}{w}x} - {\frac{\left( {v_{1y} - v_{0y}} \right)}{w}y} + v_{0x}}} \\{v_{y} = {{\frac{\left( {v_{1y} - v_{0y}} \right)}{w}x} + {\frac{\left( {v_{1x} - v_{0x}} \right)}{w}y} + v_{0y}}}\end{matrix} \right. & (2)\end{matrix}$

Here, x and y are the horizontal and vertical positions of thesub-block, respectively, and w is a predetermined weighted coefficient.

Such an affine motion compensation prediction mode may include a numberof modes of different methods of deriving the motion vectors of the topleft and top right corner control points. Information indicating such anaffine motion compensation prediction mode (referred to as, for example,an affine flag) is signalled at the CU level. Note that the signaling ofinformation indicating the affine motion compensation prediction modeneed not be performed at the CU level, and may be performed at anotherlevel (for example, at the sequence level, picture level, slice level,tile level, CTU level, or sub-block level).

[Prediction Controller]

Prediction controller 128 selects either the intra prediction signal orthe inter prediction signal, and outputs the selected prediction signalto subtractor 104 and adder 116.

Here, an example of deriving a motion vector via merge mode in a currentpicture will be given. FIG. 9B is for illustrating an outline of aprocess for deriving a motion vector via merge mode.

First, an MV predictor list in which candidate MV predictors areregistered is generated. Examples of candidate MV predictors include:spatially neighboring MV predictors, which are MVs of encoded blockspositioned in the spatial vicinity of the current block; a temporallyneighboring MV predictor, which is an MV of a block in an encodedreference picture that neighbors a block in the same location as thecurrent block; a combined MV predictor, which is an MV generated bycombining the MV values of the spatially neighboring MV predictor andthe temporally neighboring MV predictor; and a zero MV predictor, whichis an MV whose value is zero.

Next, the MV of the current block is determined by selecting one MVpredictor from among the plurality of MV predictors registered in the MVpredictor list.

Furthermore, in the variable-length encoder, a merge_idx, which is asignal indicating which MV predictor is selected, is written and encodedinto the stream.

Note that the MV predictors registered in the MV predictor listillustrated in FIG. 9B constitute one example. The number of MVpredictors registered in the MV predictor list may be different from thenumber illustrated in FIG. 9B, the MV predictors registered in the MVpredictor list may omit one or more of the types of MV predictors givenin the example in FIG. 9B, and the MV predictors registered in the MVpredictor list may include one or more types of MV predictors inaddition to and different from the types given in the example in FIG.9B.

Note that the final MV may be determined by performing DMVR processing(to be described later) by using the MV of the current block derived viamerge mode.

Here, an example of determining an MV by using DMVR processing will begiven.

FIG. 9C is a conceptual diagram for illustrating an outline of DMVRprocessing.

First, the most appropriate MVP set for the current block is consideredto be the candidate MV, reference pixels are obtained from a firstreference picture, which is a picture processed in the L0 direction inaccordance with the candidate MV, and a second reference picture, whichis a picture processed in the L1 direction in accordance with thecandidate MV, and a template is generated by calculating the average ofthe reference pixels.

Next, using the template, the surrounding regions of the candidate MVsof the first and second reference pictures are searched, and the MV withthe lowest cost is determined to be the final MV. Note that the costvalue is calculated using, for example, the difference between eachpixel value in the template and each pixel value in the regionssearched, as well as the MV value.

Note that the outlines of the processes described here are fundamentallythe same in both the encoder and the decoder.

Note that processing other than the processing exactly as describedabove may be used, so long as the processing is capable of deriving thefinal MV by searching the surroundings of the candidate MV.

Here, an example of a mode that generates a prediction image by usingLIC processing will be given.

FIG. 9D is for illustrating an outline of a prediction image generationmethod using a luminance correction process performed via LICprocessing.

First, an MV is extracted for obtaining, from an encoded referencepicture, a reference image corresponding to the current block.

Next, information indicating how the luminance value changed between thereference picture and the current picture is extracted and a luminancecorrection parameter is calculated by using the luminance pixel valuesfor the encoded left neighboring reference region and the encoded upperneighboring reference region, and the luminance pixel value in the samelocation in the reference picture specified by the MV.

The prediction image for the current block is generated by performing aluminance correction process by using the luminance correction parameteron the reference image in the reference picture specified by the MV.

Note that the shape of the surrounding reference region illustrated inFIG. 9D is just one example; the surrounding reference region may have adifferent shape.

Moreover, although a prediction image is generated from a singlereference picture in this example, in cases in which a prediction imageis generated from a plurality of reference pictures as well, theprediction image is generated after performing a luminance correctionprocess, via the same method, on the reference images obtained from thereference pictures.

One example of a method for determining whether to implement LICprocessing is by using an lic_flag, which is a signal that indicateswhether to implement LIC processing. As one specific example, theencoder determines whether the current block belongs to a region ofluminance change. The encoder sets the lic_flag to a value of “1” whenthe block belongs to a region of luminance change and implements LICprocessing when encoding, and sets the lic_flag to a value of “0” whenthe block does not belong to a region of luminance change and encodeswithout implementing LIC processing. The decoder switches betweenimplementing LIC processing or not by decoding the lic_flag written inthe stream and performing the decoding in accordance with the flagvalue.

One example of a different method of determining whether to implementLIC processing is determining so in accordance with whether LICprocessing was determined to be implemented for a surrounding block. Inone specific example, when merge mode is used on the current block,whether LIC processing was applied in the encoding of the surroundingencoded block selected upon deriving the MV in the merge mode processingmay be determined, and whether to implement LIC processing or not can beswitched based on the result of the determination. Note that in thisexample, the same applies to the processing performed on the decoderside.

[Decoder Outline]

Next, a decoder capable of decoding an encoded signal (encodedbitstream) output from encoder 100 will be described. FIG. 10 is a blockdiagram illustrating a functional configuration of decoder 200 accordingto Embodiment 1. Decoder 200 is a moving picture/picture decoder thatdecodes a moving picture/picture block by block.

As illustrated in FIG. 10, decoder 200 includes entropy decoder 202,inverse quantizer 204, inverse transformer 206, adder 208, block memory210, loop filter 212, frame memory 214, intra predictor 216, interpredictor 218, and prediction controller 220.

Decoder 200 is realized as, for example, a generic processor and memory.In this case, when a software program stored in the memory is executedby the processor, the processor functions as entropy decoder 202,inverse quantizer 204, inverse transformer 206, adder 208, loop filter212, intra predictor 216, inter predictor 218, and prediction controller220. Alternatively, decoder 200 may be realized as one or more dedicatedelectronic circuits corresponding to entropy decoder 202, inversequantizer 204, inverse transformer 206, adder 208, loop filter 212,intra predictor 216, inter predictor 218, and prediction controller 220.

Hereinafter, each constituent element included in decoder 200 will bedescribed.

[Entropy Decoder]

Entropy decoder 202 entropy decodes an encoded bitstream. Morespecifically, for example, entropy decoder 202 arithmetic decodes anencoded bitstream into a binary signal. Entropy decoder 202 thendebinarizes the binary signal. With this, entropy decoder 202 outputsquantized coefficients of each block to inverse quantizer 204.

[Inverse Quantizer]

Inverse quantizer 204 inverse quantizes quantized coefficients of ablock to be decoded (hereinafter referred to as a current block), whichare inputs from entropy decoder 202. More specifically, inversequantizer 204 inverse quantizes quantized coefficients of the currentblock based on quantization parameters corresponding to the quantizedcoefficients. Inverse quantizer 204 then outputs the inverse quantizedcoefficients (i.e., transform coefficients) of the current block toinverse transformer 206.

[Inverse Transformer]

Inverse transformer 206 restores prediction errors by inversetransforming transform coefficients, which are inputs from inversequantizer 204.

For example, when information parsed from an encoded bitstream indicatesapplication of EMT or AMT (for example, when the AMT flag is set totrue), inverse transformer 206 inverse transforms the transformcoefficients of the current block based on information indicating theparsed transform type.

Moreover, for example, when information parsed from an encoded bitstreamindicates application of NSST, inverse transformer 206 applies asecondary inverse transform to the transform coefficients.

[Adder]

Adder 208 reconstructs the current block by summing prediction errors,which are inputs from inverse transformer 206, and prediction samples,which is an input from prediction controller 220. Adder 208 then outputsthe reconstructed block to block memory 210 and loop filter 212.

[Block Memory]

Block memory 210 is storage for storing blocks in a picture to bedecoded (hereinafter referred to as a current picture) for reference inintra prediction. More specifically, block memory 210 storesreconstructed blocks output from adder 208.

[Loop Filter]

Loop filter 212 applies a loop filter to blocks reconstructed by adder208, and outputs the filtered reconstructed blocks to frame memory 214and, for example, a display device.

When information indicating the enabling or disabling of ALF parsed froman encoded bitstream indicates enabled, one filter from among aplurality of filters is selected based on direction and activity oflocal gradients, and the selected filter is applied to the reconstructedblock.

[Frame Memory]

Frame memory 214 is storage for storing reference pictures used in interprediction, and is also referred to as a frame buffer. Morespecifically, frame memory 214 stores reconstructed blocks filtered byloop filter 212.

[Intra Predictor]

Intra predictor 216 generates a prediction signal (intra predictionsignal) by intra prediction with reference to a block or blocks in thecurrent picture and stored in block memory 210. More specifically, intrapredictor 216 generates an intra prediction signal by intra predictionwith reference to samples (for example, luma and/or chroma values) of ablock or blocks neighboring the current block, and then outputs theintra prediction signal to prediction controller 220.

Note that when an intra prediction mode in which a chroma block is intrapredicted from a luma block is selected, intra predictor 216 may predictthe chroma component of the current block based on the luma component ofthe current block.

Moreover, when information indicating the application of PDPC is parsedfrom an encoded bitstream, intra predictor 216 correctspost-intra-prediction pixel values based on horizontal/verticalreference pixel gradients.

[Inter Predictor]

Inter predictor 218 predicts the current block with reference to areference picture stored in frame memory 214. Inter prediction isperformed per current block or per sub-block (for example, per 4×4block) in the current block. For example, inter predictor 218 generatesan inter prediction signal of the current block or sub-block by motioncompensation by using motion information (for example, a motion vector)parsed from an encoded bitstream, and outputs the inter predictionsignal to prediction controller 220.

Note that when the information parsed from the encoded bitstreamindicates application of OBMC mode, inter predictor 218 generates theinter prediction signal using motion information for a neighboring blockin addition to motion information for the current block obtained frommotion estimation.

Moreover, when the information parsed from the encoded bitstreamindicates application of FRUC mode, inter predictor 218 derives motioninformation by performing motion estimation in accordance with thepattern matching method (bilateral matching or template matching) parsedfrom the encoded bitstream. Inter predictor 218 then performs motioncompensation using the derived motion information.

Moreover, when BIO mode is to be applied, inter predictor 218 derives amotion vector based on a model assuming uniform linear motion. Moreover,when the information parsed from the encoded bitstream indicates thataffine motion compensation prediction mode is to be applied, interpredictor 218 derives a motion vector of each sub-block based on motionvectors of neighboring blocks.

[Prediction Controller]

Prediction controller 220 selects either the intra prediction signal orthe inter prediction signal, and outputs the selected prediction signalto adder 208.

[Example of Block Splitting Method]

FIG. 11 illustrates an example of a block splitting method according toEmbodiment 1. The block splitting method may include, for example,splitting into four blocks by which a current block is split intohorizontally and vertically symmetrical four blocks; splitting intothree blocks by which a current block is split at a ratio of 1:2:1 alongthe same direction; and splitting into two blocks by which a currentblock is split at a ratio of 1:1 along the same direction.

Splitting into four blocks 31, by which a current block is split intohorizontally and vertically symmetrical four blocks, is described as nothaving a direction regarding block splitting because blocks obtained bysplitting the current block have horizontally and vertically symmetricalarrangement and shapes.

When a current block is split into three blocks, the arrangement orshapes of the blocks obtained by splitting the current block varydepending on which direction (e.g. the horizontal direction, thevertical direction) the current block is split along. For example, thereare splitting into three blocks 32 by which a current block is splitinto three blocks along the horizontal direction, and splitting intothree blocks 33 by which a current block is split into three blocksalong the vertical direction. Accordingly, the splitting into threeblocks is described as having a direction regarding block splitting.

When a current block is split into two blocks, the arrangement or shapesof the blocks obtained by splitting the current block vary depending onwhich direction (e.g. the horizontal direction, the vertical direction)the current block is split along. For example, there are splitting intotwo blocks 34 by which a current block is split into two blocks alongthe horizontal direction, and splitting into two blocks 35 by which acurrent block is split into two blocks along the vertical direction.Accordingly, the splitting into two blocks is described as having adirection regarding block splitting.

It should be noted that, regarding splitting methods other than thesplitting into two blocks and the splitting into three blocks, when thearrangement or shapes of blocks obtained by splitting a current blockvary depending on which direction (e.g., the horizontal direction, thevertical direction) the current block is split along, the splittingmethods are described as having a direction regarding block splitting.

In no splitting 36 by which a current block is not split, a currentblock has the same shape as before splitting. No splitting 36 isdescribed as not having a direction regarding block splitting.

It should be noted that the shape of a current block is not limited to asquare. The shape of a current block may be, for example, a rectangle.

When encoder 100 or decoder 200 splits a current block into two blocksor three blocks, encoder 100 or decoder 200 may hold information about adirection regarding block splitting. It should be noted that whenencoder 100 or decoder 200 holds the information about the directionregarding block splitting, encoder 100 or decoder 200 is not limited tothe splitting into two blocks or the splitting into three blocks.Further, when encoder 100 or decoder 200 holds the information about thedirection regarding block splitting, the information may include allcases in which the arrangement or shapes of blocks obtained by splittinga current block vary depending on which direction the current block issplit along.

FIG. 12 illustrates an example of a syntax tree representing informationabout the block splitting method according to Embodiment 1 that includesoptions of splitting into two blocks, splitting into three blocks,splitting into four blocks, and no splitting.

First, S denotes information indicating whether splitting is performed.Next, QT denotes information indicating whether the splitting into fourblocks is performed. Then, TT denotes information indicating whether thesplitting into three blocks is performed. Finally, Ver denotesinformation indicating a splitting direction. It should be noted thatwhen information is set so that QT is performed, information may be setso that QT is performed again. In this case, a process may recursivelyreturn from QT to QT in the syntax tree. It should be noted that thevarious types of the block splitting method illustrated in FIG. 12 maybe repeatedly applied to blocks obtained by splitting a current block.

The following describes a case of, for example, S=1, two of QT=1, TT=0,and Ver=0. First, encoder 100 or decoder 200 splits a current block intohorizontally and vertically symmetrical four blocks. Next, encoder 100or decoder 200 splits each of the blocks obtained by splitting thecurrent block into horizontally and vertically symmetrical four blocks.To put it differently, encoder 100 or decoder 200 recursively splits thecurrent block into horizontally and vertically symmetrical four blockstwo times. After that, encoder 100 or decoder 200 may horizontallysplit, into two blocks, each of the blocks obtained by the abovesplitting method.

It should be noted that the types of the splitting method illustrated inFIG. 12 are examples. The syntax tree representing the information aboutthe block splitting method may include splitting methods other than thesplitting method illustrated in FIG. 12. Further, the syntax treerepresenting the information about the block splitting method mayinclude part of the splitting method illustrated in FIG. 12.

FIG. 13A illustrates an example of scan order in a split block when acurrent block is split into horizontally and vertically symmetrical fourblocks according to Embodiment 1. FIG. 13A shows a case in which currentblock 40 is split into horizontally and vertically symmetrical fourblocks one time. Split block 50 obtained by splitting current block 40is obtained by splitting current block 40 into horizontally andvertically symmetrical four blocks. Split block 50 includes sub-block51, sub-block 52, sub-block 53, and sub-block 54. Upper-left sub-block51 and upper-right sub-block 52 in split block 50 rank zeroth and firstin the scan order in split block 50, respectively. Lower-left sub-block53 and lower-right sub-block 54 in split block 50 rank second and thirdin the scan order in split block 50, respectively.

FIG. 13B illustrates an example of scan order of blocks obtained byhorizontally splitting a current block into two blocks and verticallysplitting the two blocks each into two blocks according to Embodiment 1.FIG. 13B shows a case in which horizontal splitting into two blocks isapplied to current block 40, and vertical splitting into two blocks isfurther applied to the sub-blocks obtained by the horizontal splittinginto two blocks. Split block 60 obtained by splitting current block 40is obtained by horizontally splitting current block 40 into two blocks.Split block 60 includes sub-block 61 and sub-block 62. Next, split block70 is obtained by vertically splitting sub-block 61 and sub-block 62into halves. Split block 70 includes sub-block 71, sub-block 72,sub-block 73, and sub-block 74. Upper-left sub-block 71 and upper-rightsub-block 72 in split block 70 rank zeroth and first in the scan orderin split block 70, respectively. Lower-left sub-block 73 and lower-rightsub-block 74 in split block 70 rank second and third in the scan orderin split block 70, respectively.

FIG. 13C illustrates an example of scan order of blocks obtained byvertically splitting a current block into two blocks and horizontallysplitting the two blocks each into two blocks according to Embodiment 1.FIG. 13C shows a case in which vertical splitting into two blocks isapplied to current block 40, and horizontal splitting into two blocks isfurther applied to the sub-blocks obtained by the vertical splittinginto two blocks. Split block 80 obtained by splitting current block 40is obtained by vertically splitting current block 40 into two blocks.Split block 80 includes sub-block 81 and sub-block 82. Next, split block90 is obtained by horizontally splitting sub-block 81 and sub-block 82into two blocks. Split block 90 includes sub-block 91, sub-block 92,sub-block 93, and sub-block 94. Upper-left sub-block 91 and lower-leftsub-block 92 in split block 90 rank zeroth and first in the scan orderin split block 90, respectively. Upper-right sub-block 93 andlower-right sub-block 94 in split block 90 rank second and third in thescan order in split block 90, respectively.

As illustrated in FIG. 13A, FIG. 13B, and FIG. 13C, the encoding resultor decoding result of split block 50 in FIG. 13A is approximatelyidentical to the encoding result or decoding result of split block 70 inFIG. 13B. This is because the arrangement and shapes of sub-block 51,sub-block 52, sub-block 53, and sub-block 54 of split block 50 areidentical to the arrangement and shapes of sub-block 71, sub-block 72,sub-block 73, and sub-block 74 of split block 70. Both of the casesillustrated in FIG. 13A and FIG. 13B are the results of splittingcurrent block 40 into horizontally and vertically symmetrical fourblocks. Further, the scan order of sub-block 51, sub-block 52, sub-block53, and sub-block 54 of split block 50 is identical to the scan order ofsub-block 71, sub-block 72, sub-block 73, and sub-block 74 of splitblock 70. This is also because the encoding result or decoding result ofsplit block 50 in FIG. 13A is approximately identical to the encodingresult or decoding result of split block 70 in FIG. 13B.

Accordingly, in such cases, the splitting method for obtaining similarencoding results or decoding results has variations, and data for use inencoding or decoding are always redundant.

In contrast, the encoding result or decoding result of split block 50 inFIG. 13A and the encoding result or decoding result of split block 70 inFIG. 13B are different from the encoding result or decoding result ofsplit block 90 in FIG. 13C. The reasons are as follows. First, thearrangement and shapes of sub-block 51, sub-block 52, sub-block 53, andsub-block 54 of split block 50 and the arrangement and shapes ofsub-block 71, sub-block 72, sub-block 73, and sub-block 74 of splitblock 70 are identical to the arrangement and shapes of sub-block 91,sub-block 92, sub-block 93, and sub-block 94 of split block 90. Thecases illustrated in FIG. 13A, FIG. 13B, and FIG. 13C are the results ofsplitting current block 40 into horizontally and vertically symmetricalfour blocks. However, the scan order of sub-block 51, sub-block 52,sub-block 53, and sub-block 54 of split block 50 and the scan order ofsub-block 71, sub-block 72, sub-block 73, and sub-block 74 of splitblock 70 are different from the scan order of sub-block 91, sub-block92, sub-block 93, and sub-block 94 of split block 90.

Accordingly, in such cases, because split block 50, split block 70, andsplit block 90 differ in the scan order of the sub-blocks even thoughsplit block 50, split block 70, and split block 90 are identical in thearrangement and shapes of the sub-blocks, similar encoding results ordecoding results are not always obtained. This is because different scanorder in the encoding leads to different referability of surroundingencoded blocks. That is also because different scan order in thedecoding leads to different referability of surrounding encoded blocks.In other words, since encoding results or decoding results for differentcharacteristics can be obtained especially in intra prediction, data foruse in encoding or decoding are not always redundant.

In view of the above, a splitting method is prohibited in Embodiment 1which results in approximately identical arrangement, shapes, and scanorder of sub-blocks obtained by splitting current block 40 by thesplitting method when current block 40 is split by another splittingmethod. For example, encoder 100 or decoder 200 prohibits the splittingmethod illustrated in FIG. 13B because the arrangement, shapes, and scanorder of the sub-blocks obtained by splitting current block 40 by thesplitting method illustrated in FIG. 13B are identical to thearrangement, shapes, and scan order of the sub-blocks obtained bysplitting current block 40 by the splitting method illustrated in FIG.13A. Further, encoder 100 or decoder 200 performs the above-describedprohibition when the sub-blocks obtained by splitting current block 40are further split.

It should be noted that the shape of current block 40 is not limited toa square. The shape of current block 40 may be, for example, arectangle.

[Specific Example of Encoding in First Aspect]

FIG. 14 is a flow chart indicating a block splitting determinationprocess for encoding according to a first aspect of Embodiment 1.

First, encoder 100 determines whether current block 300 is a lowersub-block among sub-blocks obtained by horizontally splitting a blockinto two blocks (step S1000).

When encoder 100 determines that current block 300 is the lowersub-block among the sub-blocks obtained by horizontally splitting theblock into two blocks (YES in step S1001), encoder 100 determineswhether encoder 100 has further vertically split an upper sub-block intotwo blocks among the sub-blocks obtained by horizontally splitting theblock into two blocks (step S1001).

When encoder 100 determines that encoder 100 has further verticallysplit the upper sub-block into two blocks among the sub-blocks obtainedby horizontally splitting the block into two blocks (YES in step S1001),encoder 100 prohibits vertical splitting of current block 300 into twoblocks (step S1003). When encoder 100 splits current block 300, encoder100 can select any splitting method other than the splitting methodprohibited by encoder 100.

Encoder 100 may assess the encoding capabilities of splitting methodsdetermined as selectable by encoder 100, and select a splitting methodfrom among the splitting methods determined as selectable, based on theassessment. For example, encoder 100 may select a splitting method thatbrings the highest encoding capability from among the splitting methodsdetermined as selectable.

When encoder 100 prohibits vertical splitting of current block 300 intotwo blocks, encoder 100 may omit to evaluate the prohibited splittingmethod. Further, encoder 100 may omit to encode information necessaryfor specifying the prohibited splitting method. Specifically, when thereare a signal that indicates whether to split current block 300, and asignal that indicates whether a direction along which current block 300is split is the vertical direction or the horizontal direction, encoder100 need not encode the former signal and may encode the latter signal.

When encoder 100 determines that current block 300 is not the lowersub-block among the sub-blocks obtained by horizontally splitting theblock into two blocks (NO in step S1000), encoder 100 places no limitson encoder 100 splitting current block 300 (step S1002). When encoder100 splits current block 300, encoder 100 can select a given splittingmethod.

Encoder 100 may assess the encoding capabilities of given splittingmethods, and select a splitting method from among splitting methodsdetermined as selectable, based on the assessment. For example, encoder100 may select a splitting method that brings the highest encodingcapability from among the given splitting methods.

When encoder 100 determines that encoder 100 has not further verticallysplit the upper sub-block into two blocks among the sub-blocks obtainedby horizontally splitting the block into two blocks (NO in step S1001),encoder 100 places no limits on encoder 100 splitting current block 300(step S1002). When encoder 100 splits current block 300, encoder 100 canselect a given splitting method.

Encoder 100 may assess the encoding capabilities of given splittingmethods, and select a splitting method from among splitting methodsdetermined as selectable, based on the assessment. For example, encoder100 may select a splitting method that brings the highest encodingcapability from among the given splitting methods.

Here, encoder 100 ends the processing.

It should be noted that, in step S1000, encoder 100 may determinewhether current block 300 is an upper sub-block among sub-blocksobtained by horizontally splitting a block into two blocks.

Moreover, in step S1001, when encoder 100 determines that current block300 is the upper sub-block among the sub-blocks obtained by horizontallysplitting the block into two blocks, encoder 100 may determine whetherencoder 100 has further vertically split a lower sub-block into twoblocks among the sub-blocks obtained by horizontally splitting the blockinto two blocks.

Moreover, in step 51002, when encoder 100 determines that current block300 is not the upper sub-block among the sub-blocks obtained byhorizontally splitting the block into two blocks, encoder 100 need notplace limits on encoder 100 splitting current block 300.

Moreover, in step S1002, when encoder 100 determines that encoder 100has not further vertically split a lower sub-block into two blocks amongthe sub-blocks obtained by horizontally splitting the block into twoblocks, encoder 100 need not place limits on encoder 100 splittingcurrent block 300.

Moreover, in step S1003, when encoder 100 determines that encoder 100has further vertically split the lower sub-block into two blocks amongthe sub-blocks obtained by horizontally splitting the block into twoblocks, encoder 100 may prohibit vertical splitting of current block 300into two blocks.

It should be noted that current block 300 may be limited to a lowersub-block among sub-blocks obtained by horizontally splitting a blockinto two blocks in consideration of scan order of the sub-blocks.

It should be noted that although the prohibited splitting method is thevertical splitting into two blocks in the processing shown in FIG. 14,the prohibited splitting method may be another splitting method.Further, the conditions determined by encoder 100 in the processingshown in FIG. 14 are mere examples, and conditions are not limited tothe above-described conditions.

For example, the condition determined by encoder 100 in step S1000 maybe determining whether current block 300 is a right sub-block amongsub-blocks obtained by vertically splitting a block into two blocks.Further, the condition determined by encoder 100 in step S1000 may bedetermining whether current block 300 is a left sub-block among thesub-blocks obtained by vertically splitting the block into two blocks.

Moreover, in step S1001, when encoder 100 determines that current block300 is the left sub-block among the sub-blocks obtained by verticallysplitting the block into two blocks, encoder 100 may determine whetherencoder 100 has further horizontally split the right sub-block into twoblocks among the sub-blocks obtained by vertically splitting the blockinto two blocks.

Furthermore, in step S1001, when encoder 100 determines that currentblock 300 is the right sub-block among the sub-blocks obtained byvertically splitting the block into two blocks, encoder 100 maydetermine whether encoder 100 has further horizontally split the leftsub-block into two blocks among the sub-blocks obtained by verticallysplitting the block into two blocks.

Moreover, in step S1002, when encoder 100 determines that current block300 is not the left sub-block among the sub-blocks obtained byhorizontally splitting the block into two blocks, encoder 100 need notplace limits on encoder 100 splitting current block 300.

Furthermore, in step S1002, when encoder 100 determines that currentblock 300 is not the right sub-block among the sub-blocks obtained byhorizontally splitting the block into two blocks, encoder 100 need notplace limits on encoder 100 splitting current block 300.

Moreover, in step S1003, when encoder 100 determines that encoder 100has further horizontally split the left sub-block into two blocks amongthe sub-blocks obtained by vertically splitting the block into twoblocks, encoder 100 may prohibit horizontal splitting of current block300 into two blocks.

Furthermore, in step S1003, when encoder 100 determines that encoder 100has further horizontally split the right sub-block into two blocks amongthe sub-blocks obtained by vertically splitting the block into twoblocks, encoder 100 may prohibit horizontal splitting of current block300 into two blocks.

It should be noted that current block 300 may be limited to a leftsub-block among sub-blocks obtained by vertically splitting a block intotwo blocks in consideration of scan order of the sub-blocks.

It should be noted that the above-described processing performed byencoder 100 may be performed by decoder 200 through replacement of“encoding” with “decoding.”

[Variations]

When encoder 100 has a different block splitting structure between lumasignals and chroma signals, block splitting may be applied to at leastone of the luma signals and the chroma signals.

Encoder 100 determines whether to perform the processing included in thepresent disclosure on a per slice basis. When determining to perform theprocessing, encoder 100 may perform the processing.

Encoder 100 determines whether to perform the processing included in thepresent disclosure on a per tile basis. When determining to perform theprocessing, encoder 100 may perform the processing.

Encoder 100 determines whether to perform the processing included in thepresent disclosure according to a slice type (I slice, P slice, B slice,etc.). When determining to perform the processing, encoder 100 mayperform the processing.

Encoder 100 determines whether to perform the processing included in thepresent disclosure according to a prediction mode (intra prediction,inter prediction, normal inter mode, merge mode, etc.). When determiningto perform the processing, encoder 100 may perform the processing.

Encoder 100 may write a flag that indicates that the processing includedin the present disclosure is being performed, into a syntax such as asequence layer, a picture layer, and a slice layer.

When decoder 200 has a different block splitting structure between lumasignals and chroma signals, block splitting may be applied to at leastone of the luma signals and the chroma signals.

Decoder 200 determines whether to perform the processing included in thepresent disclosure on a per slice basis. When determining to perform theprocessing, decoder 200 may perform the processing.

Decoder 200 determines whether to perform the processing included in thepresent disclosure on a per tile basis. When determining to perform theprocessing, decoder 200 may perform the processing.

Decoder 200 determines whether to perform the processing included in thepresent disclosure according to a slice type (I slice, P slice, B slice,etc.). When determining to perform the processing, decoder 200 mayperform the processing.

Decoder 200 determines whether to perform the processing included in thepresent disclosure according to a prediction mode (intra prediction,inter prediction, normal inter mode, merge mode, etc.). When determiningto perform the processing, decoder 200 may perform the processing.

Decoder 200 may analyze a flag that indicates that the processingincluded in the present disclosure is being performed, from a syntaxsuch as a sequence layer, a picture layer, and a slice layer.

[Implementation Example]

FIG. 15 is a block diagram illustrating an implementation example ofencoder 100 according to Embodiment 1. Encoder 100 includes circuitry150 and memory 152. For example, the plurality of constituent elementsof encoder 100 illustrated in FIG. 1 are implemented by circuitry 150and memory 152 illustrated in FIG. 15.

Circuitry 150 is electronic circuitry accessible to memory 152, andperforms information processing. For example, circuitry 150 is exclusiveor general electronic circuitry which encodes a video using memory 152.Circuitry 150 may be a processor such as a central processing unit(CPU). Circuitry 150 may be an aggregate of a plurality of electroniccircuits.

Moreover, for example, circuitry 150 may perform the functions of two ormore constituent elements among the plurality of constituent elements ofencoder 100 illustrated in FIG. 1, except the constituent elements thatstore information. In other words, circuitry 150 may perform theabove-described operations as the operations of the two or moreconstituent elements.

Memory 152 is an exclusive or general memory for storing informationused by circuitry 150 to encode a video. Memory 152 may be an electroniccircuit, may be connected to circuitry 150, or may be included incircuitry 150.

Memory 152 may be an aggregate of a plurality of electronic circuits, ormay be configured in the form of a plurality of sub-memories. Memory 152may be a magnetic disc, an optical disc, or the like, or may beexpressed as storage, a recording medium, or the like. Memory 152 may bea non-volatile memory or a volatile memory.

For example, memory 152 may perform the functions of, among theplurality of constituent elements of encoder 100 illustrated in FIG. 1,the constituent elements that store information.

Moreover, memory 152 may store a video to be encoded, or may store abitstream corresponding to an encoded video. Memory 152 may store aprogram for causing circuitry 150 to encode a video.

Note that not all of the plurality of constituent elements illustratedin FIG. 1 need to be implemented by encoder 100, and not all of theprocesses described above need to be performed by encoder 100. Some ofthe constituent elements illustrated in FIG. 1 may be included inanother device, and some of the processes described above may beperformed by another device. Information related to encoding of a videocan be appropriately set by encoder 100 implementing some of theconstituent elements illustrated in FIG. 1 and performing some of theprocesses described above.

FIG. 16 is a flow chart indicating an operation example performed by theencoder according to Embodiment 1. For example, encoder 100 illustratedin FIG. 15 performs operations illustrated in FIG. 16 when encoder 100initializes a probability parameter for entropy encoding. Specifically,circuitry 150 performs the following operations using memory 152.

First, circuitry 150 determines whether the arrangement and shapes ofblocks obtained by splitting a first block multiple times by a firstsplitting method are identical to the arrangement and shapes of blocksobtained by splitting the first block multiple times by a secondsplitting method different from the first splitting method (step S2001).

When circuitry 150 determines that the arrangement and shapes of theblocks obtained by splitting the first block multiple times by the firstsplitting method are identical to the arrangement and shapes of theblocks obtained by splitting the first block multiple times by thesecond splitting method different from the first splitting method (YESin step S2001), circuitry 150 determines whether, in the first block,the scan order of the blocks obtained by the first splitting method isidentical to the scan order of the blocks obtained by the secondsplitting method (step S2002).

When circuitry 150 determines that, in the first block, the scan orderof the blocks obtained by the first splitting method is identical to thescan order of the blocks obtained by the second splitting method (YES instep S2002), circuitry 150 prohibits the first splitting method (stepS2003).

In contrast, when circuitry 150 determines that the arrangement andshapes of the blocks obtained by splitting the first block multipletimes by the first splitting method are not identical to the arrangementand shapes of the blocks obtained by splitting the first block multipletimes by the second splitting method different from the first splittingmethod (NO in step S2001), circuitry 150 avoids prohibiting the firstsplitting method (step S2004).

When circuitry 150 determines that, in the first block, the scan orderof the blocks obtained by the first splitting method is not identical tothe scan order of the blocks obtained by the second splitting method (NOin step S2002), circuitry 150 avoids prohibiting the first splittingmethod (step S2004).

Subsequently, circuitry 150 encodes the first block (step S2005).

Finally, circuitry 150 completes the operations.

Moreover, the first splitting method prohibited may be a splittingmethod of vertically splitting, when the first block is horizontallysplit into two blocks and an upper block of the two blocks is furthervertically split into other two blocks, a lower block of the two blocksinto two blocks.

Moreover, circuitry 150 need not encode a signal for specifying thefirst splitting method prohibited.

Moreover, the signal may specify a direction along which, when the firstblock is horizontally split into two blocks and an upper block of thetwo blocks is further vertically split into other two blocks, a lowerblock of the two blocks is split.

Accordingly, encoder 100 can prohibit splitting patterns that makeencoded data redundant and which, after splitting is performed, resultin the identical arrangement, shapes, and scan order of blocks obtainedby the splitting. For example, encoder 100 can prohibit repeatedlysplitting the first block into two blocks which results in thearrangement, shapes, and scan order of the blocks obtained by thesplitting that are identical to those resulting from splitting the firstblock into four blocks. Consequently, encoder 100 can omit redundantencoding and a redundant portion of encoding a signal into a streamwithout degrading the encoding performance. For this reason, encoder 100can reduce an amount of processing and an amount of encoding.

FIG. 17 is a block diagram illustrating an implementation example ofdecoder 200 according to Embodiment 1. Decoder 200 includes circuitry250 and memory 252. For example, the plurality of constituent elementsof decoder 200 illustrated in FIG. 10 are implemented by circuitry 250and memory 252 illustrated in FIG. 17.

Circuitry 250 is electronic circuitry accessible to memory 252, andperforms information processing. For example, circuitry 250 is exclusiveor general electronic circuitry which encodes a video using memory 252.Circuitry 250 may be a processor such as a central processing unit(CPU). Circuitry 250 may be an aggregate of a plurality of electroniccircuits.

Moreover, for example, circuitry 250 may perform the functions of two ormore constituent elements among the plurality of constituent elements ofdecoder 200 illustrated in FIG. 10, except the constituent elements thatstore information. In other words, circuitry 250 may perform theabove-described operations as the operations of the two or moreconstituent elements.

Memory 252 is an exclusive or general memory for storing informationused by circuitry 250 to encode a video. Memory 252 may be an electroniccircuit, may be connected to circuitry 250, or may be included incircuitry 250.

Memory 252 may be an aggregate of a plurality of electronic circuits, ormay be configured in the form of a plurality of sub-memories. Memory 252may be a magnetic disc, an optical disc, or the like, or may beexpressed as storage, a recording medium, or the like. Memory 252 may bea non-volatile memory or a volatile memory.

For example, memory 252 may perform the functions of, among theplurality of constituent elements of decoder 200 illustrated in FIG. 10,the constituent elements that store information.

Moreover, memory 252 may store a video to be encoded, or may store abitstream corresponding to an encoded video. Memory 252 may store aprogram for causing circuitry 250 to encode a video.

Note that not all of the plurality of constituent elements illustratedin FIG. 10 need to be implemented by decoder 200, and not all of theprocesses described above need to be performed by decoder 200. Some ofthe constituent elements illustrated in FIG. 10 may be included inanother device, and some of the processes described above may beperformed by another device. Information related to encoding of a videocan be appropriately set by decoder 200 implementing some of theconstituent elements illustrated in FIG. 10 and performing some of theprocesses described above.

FIG. 18 is a flow chart indicating an operation example performed bydecoder 200 according to Embodiment 1. For example, decoder 200illustrated in FIG. 17 performs operations illustrated in FIG. 18 whendecoder 200 initializes a probability parameter for entropy encoding.Specifically, circuitry 250 performs the following operations usingmemory 252.

First, circuitry 250 determines whether the arrangement and shapes ofblocks obtained by splitting a first block multiple times by a firstsplitting method are identical to the arrangement and shapes of blocksobtained by splitting the first block multiple times by a secondsplitting method different from the first splitting method (step S3001).

When circuitry 250 determines that the arrangement and shapes of theblocks obtained by splitting the first block multiple times by the firstsplitting method are identical to the arrangement and shapes of theblocks obtained by splitting the first block multiple times by thesecond splitting method different from the first splitting method (YESin step S3001), circuitry 250 determines whether, in the first block,the scan order of the blocks obtained by the first splitting method isidentical to the scan order of the blocks obtained by the secondsplitting method (step S3002).

When circuitry 250 determines that, in the first block, the scan orderof the blocks obtained by the first splitting method is identical to thescan order of the blocks obtained by the second splitting method (YES instep S3002), circuitry 250 prohibits the first splitting method (stepS3003).

In contrast, when circuitry 250 determines that the arrangement andshapes of the blocks obtained by splitting the first block multipletimes by the first splitting method are not identical to the arrangementand shapes of the blocks obtained by splitting the first block multipletimes by the second splitting method different from the first splittingmethod (NO in step S3001), circuitry 250 avoids prohibiting the firstsplitting method (step S3004).

When circuitry 250 determines that, in the first block, the scan orderof the blocks obtained by the first splitting method is not identical tothe scan order of the blocks obtained by the second splitting method (NOin step S3002), circuitry 250 avoids prohibiting the first splittingmethod (step S3004).

Subsequently, circuitry 250 decodes the first block (step S3005).

Finally, circuitry 250 completes the operations.

Moreover, the first splitting method prohibited may be a splittingmethod of vertically splitting, when the first block is horizontallysplit into two blocks and an upper block of the two blocks is furthervertically split into other two blocks, a lower block of the two blocksinto two blocks.

Moreover, circuitry 250 need not decode a signal for specifying thefirst splitting method prohibited.

Moreover, the signal may specify a direction along which, when the firstblock is horizontally split into two blocks and an upper block of thetwo blocks is vertically split into other two blocks, a lower block ofthe two blocks is split.

Accordingly, decoder 200 can prohibit splitting patterns that makedecoded data redundant and which, after splitting is performed, resultin the identical arrangement, shapes, and scan order of blocks obtainedby the splitting. For example, decoder 200 can prohibit repeatedlysplitting the first block into two blocks which results in thearrangement, shapes, and scan order of the blocks obtained by thesplitting that are identical to those resulting from splitting the firstblock into four blocks. Consequently, decoder 200 can omit redundantdecoding and a redundant portion of decoding a signal from a streamwithout degrading the decoding performance. For this reason, decoder 200can reduce an amount of processing and an amount of decoding.

[Supplemental Information]

Encoder 100 and decoder 200 according to the present embodiment may beused as an image encoder and an image decoder, or may be used as a videoencoder and a video decoder.

It should be noted that, each of the constituent elements in the presentembodiment may be configured in the form of an exclusive hardwareproduct, or may be implemented by executing a software program suitablefor the constituent element. Each of the constituent elements may beimplemented by means of a program execution unit, such as a CPU or aprocessor, reading and executing a software program recorded on arecording medium such as a hard disk or a semiconductor memory.

More specifically, each of encoder 100 and decoder 200 may includeprocessing circuitry and storage which is electrically connected to theprocessing circuitry and accessible from the processing circuitry. Forexample, the processing circuitry corresponds to circuitry 150 or 250,and the storage corresponds to memory 152 or 252.

The processing circuitry includes at least one of an exclusive hardwareproduct and a program execution unit, and performs processing using thestorage. In addition, when the processing circuitry includes a programexecution unit, the storage stores a software program that is executedby the program execution unit.

Here, the software for implementing, for example, encoder 100 or decoder200 according to the present embodiment includes a program as indicatedbelow.

Specifically, the program may cause a computer to (i) prohibit a firstsplitting method when the arrangement and shapes of blocks obtained bysplitting a first block multiple times by the first splitting method areidentical to the arrangement and shapes of blocks obtained by splittingthe first block multiple times by a second splitting method differentfrom the first splitting method, and when, in the first block, the scanorder of the blocks obtained by the first splitting method is identicalto the scan order of the blocks obtained by the second splitting method,and (ii) encode the first block.

Alternatively, the program may cause a computer to (i) prohibit a firstsplitting method when the arrangement and shapes of blocks obtained bysplitting a first block multiple times by the first splitting method areidentical to the arrangement and shapes of blocks obtained by splittingthe first block multiple times by a second splitting method differentfrom the first splitting method, and when, in the first block, the scanorder of the blocks obtained by the first splitting method is identicalto the scan order of the blocks obtained by the second splitting method,and (ii) decode the first block.

The constituent elements may be circuits as described above. Thecircuits may constitute circuitry as a whole, or may be individualcircuits. Each constituent element may be implemented by a generalprocessor, or may be implemented by an exclusive processor.

Moreover, processing executed by a particular constituent element may beexecuted by another constituent element. The processing execution ordermay be modified, or a plurality of processes may be executed inparallel. Furthermore, an encoding and decoding device may includeencoder 100 and decoder 200.

The ordinal numbers such as “first” and “second” used in the descriptionmay be changed as appropriate. A new ordinal number may be given to theconstituent elements, or the ordinal numbers of the constituent elementsmay be removed.

Although some aspects of encoder 100 and decoder 200 have been describedabove based on the embodiment, the aspects of encoder 100 and decoder200 are not limited to this embodiment. Various modifications to thisembodiment that are conceivable to those skilled in the art, as well asembodiments resulting from combinations of constituent elements indifferent embodiments may be included within the scope of the aspects ofencoder 100 and decoder 200, so long as they do not depart from theessence of the present disclosure.

This aspect may be implemented in combination with one or more of theother aspects according to the present disclosure. In addition, part ofthe processes in the flowcharts, part of the constituent elements of theapparatuses, and part of the syntax described in this aspect may beimplemented in combination with other aspects.

Embodiment 2

As described in each of the above embodiments, each functional block cantypically be realized as an MPU and memory, for example. Moreover,processes performed by each of the functional blocks are typicallyrealized by a program execution unit, such as a processor, reading andexecuting software (a program) recorded on a recording medium such asROM. The software may be distributed via, for example, downloading, andmay be recorded on a recording medium such as semiconductor memory anddistributed. Note that each functional block can, of course, also berealized as hardware (dedicated circuit).

Moreover, the processing described in each of the embodiments may berealized via integrated processing using a single apparatus (system),and, alternatively, may be realized via decentralized processing using aplurality of apparatuses. Moreover, the processor that executes theabove-described program may be a single processor or a plurality ofprocessors. In other words, integrated processing may be performed, and,alternatively, decentralized processing may be performed.

Embodiments of the present disclosure are not limited to the aboveexemplary embodiment; various modifications may be made to the exemplaryembodiment, the results of which are also included within the scope ofthe embodiments of the present disclosure.

Next, application examples of the moving picture encoding method (imageencoding method) and the moving picture decoding method (image decodingmethod) described in each of the above embodiments and a system thatemploys the same will be described. The system is characterized asincluding an image encoder that employs the image encoding method, animage decoder that employs the image decoding method, and an imageencoder/decoder that includes both the image encoder and the imagedecoder. Other configurations included in the system may be modified ona case-by-case basis.

[Usage Examples]

FIG. 19 illustrates an overall configuration of content providing systemex100 for implementing a content distribution service. The area in whichthe communication service is provided is divided into cells of desiredsizes, and base stations ex106, ex107, ex108, ex109, and ex110, whichare fixed wireless stations, are located in respective cells.

In content providing system ex100, devices including computer ex111,gaming device ex112, camera ex113, home appliance ex114, and smartphoneex115 are connected to internet ex101 via internet service providerex102 or communications network ex104 and base stations ex106 throughex110. Content providing system ex100 may combine and connect anycombination of the above elements. The devices may be directly orindirectly connected together via a telephone network or near fieldcommunication rather than via base stations ex106 through ex110, whichare fixed wireless stations. Moreover, streaming server ex103 isconnected to devices including computer ex111, gaming device ex112,camera ex113, home appliance ex114, and smartphone ex115 via, forexample, internet ex101. Streaming server ex103 is also connected to,for example, a terminal in a hotspot in airplane ex117 via satelliteex116.

Note that instead of base stations ex106 through ex110, wireless accesspoints or hotspots may be used. Streaming server ex103 may be connectedto communications network ex104 directly instead of via internet ex101or internet service provider ex102, and may be connected to airplaneex117 directly instead of via satellite ex116.

Camera ex113 is a device capable of capturing still images and video,such as a digital camera. Smartphone ex115 is a smartphone device,cellular phone, or personal handyphone system (PHS) phone that canoperate under the mobile communications system standards of the typical2G, 3G, 3.9G, and 4G systems, as well as the next-generation 5G system.

Home appliance ex118 is, for example, a refrigerator or a deviceincluded in a home fuel cell cogeneration system. In content providingsystem ex100, a terminal including an image and/or video capturingfunction is capable of, for example, live streaming by connecting tostreaming server ex103 via, for example, base station ex106. When livestreaming, a terminal (e.g., computer ex111, gaming device ex112, cameraex113, home appliance ex114, smartphone ex115, or airplane ex117)performs the encoding processing described in the above embodiments onstill-image or video content captured by a user via the terminal,multiplexes video data obtained via the encoding and audio data obtainedby encoding audio corresponding to the video, and transmits the obtaineddata to streaming server ex103. In other words, the terminal functionsas the image encoder according to one aspect of the present disclosure.

Streaming server ex103 streams transmitted content data to clients thatrequest the stream. Client examples include computer ex111, gamingdevice ex112, camera ex113, home appliance ex114, smartphone ex115, andterminals inside airplane ex117, which are capable of decoding theabove-described encoded data. Devices that receive the streamed datadecode and reproduce the received data. In other words, the devices eachfunction as the image decoder according to one aspect of the presentdisclosure.

[Decentralized Processing]

Streaming server ex103 may be realized as a plurality of servers orcomputers between which tasks such as the processing, recording, andstreaming of data are divided. For example, streaming server ex103 maybe realized as a content delivery network (CDN) that streams content viaa network connecting multiple edge servers located throughout the world.In a CDN, an edge server physically near the client is dynamicallyassigned to the client. Content is cached and streamed to the edgeserver to reduce load times. In the event of, for example, some kind ofan error or a change in connectivity due to, for example, a spike intraffic, it is possible to stream data stably at high speeds since it ispossible to avoid affected parts of the network by, for example,dividing the processing between a plurality of edge servers or switchingthe streaming duties to a different edge server, and continuingstreaming.

Decentralization is not limited to just the division of processing forstreaming; the encoding of the captured data may be divided between andperformed by the terminals, on the server side, or both. In one example,in typical encoding, the processing is performed in two loops. The firstloop is for detecting how complicated the image is on a frame-by-frameor scene-by-scene basis, or detecting the encoding load. The second loopis for processing that maintains image quality and improves encodingefficiency. For example, it is possible to reduce the processing load ofthe terminals and improve the quality and encoding efficiency of thecontent by having the terminals perform the first loop of the encodingand having the server side that received the content perform the secondloop of the encoding. In such a case, upon receipt of a decodingrequest, it is possible for the encoded data resulting from the firstloop performed by one terminal to be received and reproduced on anotherterminal in approximately real time. This makes it possible to realizesmooth, real-time streaming.

In another example, camera ex113 or the like extracts a feature amountfrom an image, compresses data related to the feature amount asmetadata, and transmits the compressed metadata to a server. Forexample, the server determines the significance of an object based onthe feature amount and changes the quantization accuracy accordingly toperform compression suitable for the meaning of the image. Featureamount data is particularly effective in improving the precision andefficiency of motion vector prediction during the second compressionpass performed by the server. Moreover, encoding that has a relativelylow processing load, such as variable length coding (VLC), may behandled by the terminal, and encoding that has a relatively highprocessing load, such as context-adaptive binary arithmetic coding(CABAC), may be handled by the server.

In yet another example, there are instances in which a plurality ofvideos of approximately the same scene are captured by a plurality ofterminals in, for example, a stadium, shopping mall, or factory. In sucha case, for example, the encoding may be decentralized by dividingprocessing tasks between the plurality of terminals that captured thevideos and, if necessary, other terminals that did not capture thevideos and the server, on a per-unit basis. The units may be, forexample, groups of pictures (GOP), pictures, or tiles resulting fromdividing a picture. This makes it possible to reduce load times andachieve streaming that is closer to real-time.

Moreover, since the videos are of approximately the same scene,management and/or instruction may be carried out by the server so thatthe videos captured by the terminals can be cross-referenced. Moreover,the server may receive encoded data from the terminals, change referencerelationship between items of data or correct or replace picturesthemselves, and then perform the encoding. This makes it possible togenerate a stream with increased quality and efficiency for theindividual items of data.

Moreover, the server may stream video data after performing transcodingto convert the encoding format of the video data. For example, theserver may convert the encoding format from MPEG to VP, and may convertH.264 to H.265.

In this way, encoding can be performed by a terminal or one or moreservers. Accordingly, although the device that performs the encoding isreferred to as a “server” or “terminal” in the following description,some or all of the processes performed by the server may be performed bythe terminal, and likewise some or all of the processes performed by theterminal may be performed by the server. This also applies to decodingprocesses.

[3D, Multi-Angle]

In recent years, usage of images or videos combined from images orvideos of different scenes concurrently captured or the same scenecaptured from different angles by a plurality of terminals such ascamera ex113 and/or smartphone ex115 has increased. Videos captured bythe terminals are combined based on, for example, theseparately-obtained relative positional relationship between theterminals, or regions in a video having matching feature points.

In addition to the encoding of two-dimensional moving pictures, theserver may encode a still image based on scene analysis of a movingpicture either automatically or at a point in time specified by theuser, and transmit the encoded still image to a reception terminal.Furthermore, when the server can obtain the relative positionalrelationship between the video capturing terminals, in addition totwo-dimensional moving pictures, the server can generatethree-dimensional geometry of a scene based on video of the same scenecaptured from different angles. Note that the server may separatelyencode three-dimensional data generated from, for example, a pointcloud, and may, based on a result of recognizing or tracking a person orobject using three-dimensional data, select or reconstruct and generatea video to be transmitted to a reception terminal from videos capturedby a plurality of terminals.

This allows the user to enjoy a scene by freely selecting videoscorresponding to the video capturing terminals, and allows the user toenjoy the content obtained by extracting, from three-dimensional datareconstructed from a plurality of images or videos, a video from aselected viewpoint. Furthermore, similar to with video, sound may berecorded from relatively different angles, and the server may multiplex,with the video, audio from a specific angle or space in accordance withthe video, and transmit the result.

In recent years, content that is a composite of the real world and avirtual world, such as virtual reality (VR) and augmented reality (AR)content, has also become popular. In the case of VR images, the servermay create images from the viewpoints of both the left and right eyesand perform encoding that tolerates reference between the two viewpointimages, such as multi-view coding (MVC), and, alternatively, may encodethe images as separate streams without referencing. When the images aredecoded as separate streams, the streams may be synchronized whenreproduced so as to recreate a virtual three-dimensional space inaccordance with the viewpoint of the user.

In the case of AR images, the server superimposes virtual objectinformation existing in a virtual space onto camera informationrepresenting a real-world space, based on a three-dimensional positionor movement from the perspective of the user. The decoder may obtain orstore virtual object information and three-dimensional data, generatetwo-dimensional images based on movement from the perspective of theuser, and then generate superimposed data by seamlessly connecting theimages. Alternatively, the decoder may transmit, to the server, motionfrom the perspective of the user in addition to a request for virtualobject information, and the server may generate superimposed data basedon three-dimensional data stored in the server in accordance with thereceived motion, and encode and stream the generated superimposed datato the decoder. Note that superimposed data includes, in addition to RGBvalues, an a value indicating transparency, and the server sets the avalue for sections other than the object generated fromthree-dimensional data to, for example, 0, and may perform the encodingwhile those sections are transparent. Alternatively, the server may setthe background to a predetermined RGB value, such as a chroma key, andgenerate data in which areas other than the object are set as thebackground.

Decoding of similarly streamed data may be performed by the client(i.e., the terminals), on the server side, or divided therebetween. Inone example, one terminal may transmit a reception request to a server,the requested content may be received and decoded by another terminal,and a decoded signal may be transmitted to a device having a display. Itis possible to reproduce high image quality data by decentralizingprocessing and appropriately selecting content regardless of theprocessing ability of the communications terminal itself. In yet anotherexample, while a TV, for example, is receiving image data that is largein size, a region of a picture, such as a tile obtained by dividing thepicture, may be decoded and displayed on a personal terminal orterminals of a viewer or viewers of the TV. This makes it possible forthe viewers to share a big-picture view as well as for each viewer tocheck his or her assigned area or inspect a region in further detail upclose.

In the future, both indoors and outdoors, in situations in which aplurality of wireless connections are possible over near, mid, and fardistances, it is expected to be able to seamlessly receive content evenwhen switching to data appropriate for the current connection, using astreaming system standard such as MPEG-DASH. With this, the user canswitch between data in real time while freely selecting a decoder ordisplay apparatus including not only his or her own terminal, but also,for example, displays disposed indoors or outdoors. Moreover, based on,for example, information on the position of the user, decoding can beperformed while switching which terminal handles decoding and whichterminal handles the displaying of content. This makes it possible to,while in route to a destination, display, on the wall of a nearbybuilding in which a device capable of displaying content is embedded oron part of the ground, map information while on the move. Moreover, itis also possible to switch the bit rate of the received data based onthe accessibility to the encoded data on a network, such as when encodeddata is cached on a server quickly accessible from the receptionterminal or when encoded data is copied to an edge server in a contentdelivery service.

[Scalable Encoding]

The switching of content will be described with reference to a scalablestream, illustrated in FIG. 20, that is compression coded viaimplementation of the moving picture encoding method described in theabove embodiment. The server may have a configuration in which contentis switched while making use of the temporal and/or spatial scalabilityof a stream, which is achieved by division into and encoding of layers,as illustrated in FIG. 21. Note that there may be a plurality ofindividual streams that are of the same content but different quality.In other words, by determining which layer to decode up to based oninternal factors, such as the processing ability on the decoder side,and external factors, such as communication bandwidth, the decoder sidecan freely switch between low resolution content and high resolutioncontent while decoding. For example, in a case in which the user wantsto continue watching, at home on a device such as a TV connected to theinternet, a video that he or she had been previously watching onsmartphone ex115 while on the move, the device can simply decode thesame stream up to a different layer, which reduces server side load.

Furthermore, in addition to the configuration described above in whichscalability is achieved as a result of the pictures being encoded perlayer and the enhancement layer is above the base layer, the enhancementlayer may include metadata based on, for example, statisticalinformation on the image, and the decoder side may generate high imagequality content by performing super-resolution imaging on a picture inthe base layer based on the metadata. Super-resolution imaging may beimproving the SN ratio while maintaining resolution and/or increasingresolution. Metadata includes information for identifying a linear or anon-linear filter coefficient used in super-resolution processing, orinformation identifying a parameter value in filter processing, machinelearning, or least squares method used in super-resolution processing.

Alternatively, a configuration in which a picture is divided into, forexample, tiles in accordance with the meaning of, for example, an objectin the image, and on the decoder side, only a partial region is decodedby selecting a tile to decode, is also acceptable. Moreover, by storingan attribute about the object (person, car, ball, etc.) and a positionof the object in the video (coordinates in identical images) asmetadata, the decoder side can identify the position of a desired objectbased on the metadata and determine which tile or tiles include thatobject. For example, as illustrated in FIG. 21, metadata is stored usinga data storage structure different from pixel data such as an SEImessage in HEVC. This metadata indicates, for example, the position,size, or color of the main object.

Moreover, metadata may be stored in units of a plurality of pictures,such as stream, sequence, or random access units. With this, the decoderside can obtain, for example, the time at which a specific personappears in the video, and by fitting that with picture unit information,can identify a picture in which the object is present and the positionof the object in the picture.

[Web Page Optimization]

FIG. 22 illustrates an example of a display screen of a web page on, forexample, computer ex111. FIG. 23 illustrates an example of a displayscreen of a web page on, for example, smartphone ex115. As illustratedin FIG. 22 and FIG. 23, a web page may include a plurality of imagelinks which are links to image content, and the appearance of the webpage differs depending on the device used to view the web page. When aplurality of image links are viewable on the screen, until the userexplicitly selects an image link, or until the image link is in theapproximate center of the screen or the entire image link fits in thescreen, the display apparatus (decoder) displays, as the image links,still images included in the content or I pictures, displays video suchas an animated gif using a plurality of still images or I pictures, forexample, or receives only the base layer and decodes and displays thevideo.

When an image link is selected by the user, the display apparatusdecodes giving the highest priority to the base layer. Note that ifthere is information in the HTML code of the web page indicating thatthe content is scalable, the display apparatus may decode up to theenhancement layer. Moreover, in order to guarantee real timereproduction, before a selection is made or when the bandwidth isseverely limited, the display apparatus can reduce delay between thepoint in time at which the leading picture is decoded and the point intime at which the decoded picture is displayed (that is, the delaybetween the start of the decoding of the content to the displaying ofthe content) by decoding and displaying only forward reference pictures(I picture, P picture, forward reference B picture). Moreover, thedisplay apparatus may purposely ignore the reference relationshipbetween pictures and coarsely decode all B and P pictures as forwardreference pictures, and then perform normal decoding as the number ofpictures received over time increases.

[Autonomous Driving]

When transmitting and receiving still image or video data such two- orthree-dimensional map information for autonomous driving or assisteddriving of an automobile, the reception terminal may receive, inaddition to image data belonging to one or more layers, information on,for example, the weather or road construction as metadata, and associatethe metadata with the image data upon decoding. Note that metadata maybe assigned per layer and, alternatively, may simply be multiplexed withthe image data.

In such a case, since the automobile, drone, airplane, etc., includingthe reception terminal is mobile, the reception terminal can seamlesslyreceive and decode while switching between base stations among basestations ex106 through ex110 by transmitting information indicating theposition of the reception terminal upon reception request. Moreover, inaccordance with the selection made by the user, the situation of theuser, or the bandwidth of the connection, the reception terminal candynamically select to what extent the metadata is received or to whatextent the map information, for example, is updated.

With this, in content providing system ex100, the client can receive,decode, and reproduce, in real time, encoded information transmitted bythe user.

[Streaming of Individual Content]

In content providing system ex100, in addition to high image quality,long content distributed by a video distribution entity, unicast ormulticast streaming of low image quality, short content from anindividual is also possible. Moreover, such content from individuals islikely to further increase in popularity. The server may first performediting processing on the content before the encoding processing inorder to refine the individual content. This may be achieved with, forexample, the following configuration.

In real-time while capturing video or image content or after the contenthas been captured and accumulated, the server performs recognitionprocessing based on the raw or encoded data, such as capture errorprocessing, scene search processing, meaning analysis, and/or objectdetection processing. Then, based on the result of the recognitionprocessing, the server—either when prompted or automatically—edits thecontent, examples of which include: correction such as focus and/ormotion blur correction; removing low-priority scenes such as scenes thatare low in brightness compared to other pictures or out of focus; objectedge adjustment; and color tone adjustment. The server encodes theedited data based on the result of the editing. It is known thatexcessively long videos tend to receive fewer views. Accordingly, inorder to keep the content within a specific length that scales with thelength of the original video, the server may, in addition to thelow-priority scenes described above, automatically clip out scenes withlow movement based on an image processing result. Alternatively, theserver may generate and encode a video digest based on a result of ananalysis of the meaning of a scene.

Note that there are instances in which individual content may includecontent that infringes a copyright, moral right, portrait rights, etc.Such an instance may lead to an unfavorable situation for the creator,such as when content is shared beyond the scope intended by the creator.Accordingly, before encoding, the server may, for example, edit imagesso as to blur faces of people in the periphery of the screen or blur theinside of a house, for example. Moreover, the server may be configuredto recognize the faces of people other than a registered person inimages to be encoded, and when such faces appear in an image, forexample, apply a mosaic filter to the face of the person. Alternatively,as pre- or post-processing for encoding, the user may specify, forcopyright reasons, a region of an image including a person or a regionof the background be processed, and the server may process the specifiedregion by, for example, replacing the region with a different image orblurring the region. If the region includes a person, the person may betracked in the moving picture the head region may be replaced withanother image as the person moves.

Moreover, since there is a demand for real-time viewing of contentproduced by individuals, which tends to be small in data size, thedecoder first receives the base layer as the highest priority andperforms decoding and reproduction, although this may differ dependingon bandwidth. When the content is reproduced two or more times, such aswhen the decoder receives the enhancement layer during decoding andreproduction of the base layer and loops the reproduction, the decodermay reproduce a high image quality video including the enhancementlayer. If the stream is encoded using such scalable encoding, the videomay be low quality when in an unselected state or at the start of thevideo, but it can offer an experience in which the image quality of thestream progressively increases in an intelligent manner. This is notlimited to just scalable encoding; the same experience can be offered byconfiguring a single stream from a low quality stream reproduced for thefirst time and a second stream encoded using the first stream as areference.

[Other Usage Examples]

The encoding and decoding may be performed by LSI ex500, which istypically included in each terminal. LSI ex500 may be configured of asingle chip or a plurality of chips. Software for encoding and decodingmoving pictures may be integrated into some type of a recording medium(such as a CD-ROM, a flexible disk, or a hard disk) that is readable by,for example, computer ex111, and the encoding and decoding may beperformed using the software. Furthermore, when smartphone ex115 isequipped with a camera, the video data obtained by the camera may betransmitted. In this case, the video data is coded by LSI ex500 includedin smartphone ex115.

Note that LSI ex500 may be configured to download and activate anapplication. In such a case, the terminal first determines whether it iscompatible with the scheme used to encode the content or whether it iscapable of executing a specific service. When the terminal is notcompatible with the encoding scheme of the content or when the terminalis not capable of executing a specific service, the terminal firstdownloads a codec or application software then obtains and reproducesthe content.

Aside from the example of content providing system ex100 that usesinternet ex101, at least the moving picture encoder (image encoder) orthe moving picture decoder (image decoder) described in the aboveembodiments may be implemented in a digital broadcasting system. Thesame encoding processing and decoding processing may be applied totransmit and receive broadcast radio waves superimposed with multiplexedaudio and video data using, for example, a satellite, even though thisis geared toward multicast whereas unicast is easier with contentproviding system ex100.

[Hardware Configuration]

FIG. 24 illustrates smartphone ex115. FIG. 25 illustrates aconfiguration example of smartphone ex115. Smartphone ex115 includesantenna ex450 for transmitting and receiving radio waves to and frombase station ex110, camera ex465 capable of capturing video and stillimages, and display ex458 that displays decoded data, such as videocaptured by camera ex465 and video received by antenna ex450. Smartphoneex115 further includes user interface ex466 such as a touch panel, audiooutput unit ex457 such as a speaker for outputting speech or otheraudio, audio input unit ex456 such as a microphone for audio input,memory ex467 capable of storing decoded data such as captured video orstill images, recorded audio, received video or still images, and mail,as well as decoded data, and slot ex464 which is an interface for SIMex468 for authorizing access to a network and various data. Note thatexternal memory may be used instead of memory ex467.

Moreover, main controller ex460 which comprehensively controls displayex458 and user interface ex466, power supply circuit ex461, userinterface input controller ex462, video signal processor ex455, camerainterface ex463, display controller ex459, modulator/demodulator ex452,multiplexer/demultiplexer ex453, audio signal processor ex454, slotex464, and memory ex467 are connected via bus ex470.

When the user turns the power button of power supply circuit ex461 on,smartphone ex115 is powered on into an operable state by each componentbeing supplied with power from a battery pack.

Smartphone ex115 performs processing for, for example, calling and datatransmission, based on control performed by main controller ex460, whichincludes a CPU, ROM, and RAM. When making calls, an audio signalrecorded by audio input unit ex456 is converted into a digital audiosignal by audio signal processor ex454, and this is applied with spreadspectrum processing by modulator/demodulator ex452 and digital-analogconversion and frequency conversion processing by transmitter/receiverex451, and then transmitted via antenna ex450. The received data isamplified, frequency converted, and analog-digital converted, inversespread spectrum processed by modulator/demodulator ex452, converted intoan analog audio signal by audio signal processor ex454, and then outputfrom audio output unit ex457. In data transmission mode, text,still-image, or video data is transmitted by main controller ex460 viauser interface input controller ex462 as a result of operation of, forexample, user interface ex466 of the main body, and similar transmissionand reception processing is performed. In data transmission mode, whensending a video, still image, or video and audio, video signal processorex455 compression encodes, via the moving picture encoding methoddescribed in the above embodiments, a video signal stored in memoryex467 or a video signal input from camera ex465, and transmits theencoded video data to multiplexer/demultiplexer ex453. Moreover, audiosignal processor ex454 encodes an audio signal recorded by audio inputunit ex456 while camera ex465 is capturing, for example, a video orstill image, and transmits the encoded audio data tomultiplexer/demultiplexer ex453. Multiplexer/demultiplexer ex453multiplexes the encoded video data and encoded audio data using apredetermined scheme, modulates and converts the data usingmodulator/demodulator (modulator/demodulator circuit) ex452 andtransmitter/receiver ex451, and transmits the result via antenna ex450.

When video appended in an email or a chat, or a video linked from a webpage, for example, is received, in order to decode the multiplexed datareceived via antenna ex450, multiplexer/demultiplexer ex453demultiplexes the multiplexed data to divide the multiplexed data into abitstream of video data and a bitstream of audio data, supplies theencoded video data to video signal processor ex455 via synchronous busex470, and supplies the encoded audio data to audio signal processorex454 via synchronous bus ex470. Video signal processor ex455 decodesthe video signal using a moving picture decoding method corresponding tothe moving picture encoding method described in the above embodiments,and video or a still image included in the linked moving picture file isdisplayed on display ex458 via display controller ex459. Moreover, audiosignal processor ex454 decodes the audio signal and outputs audio fromaudio output unit ex457. Note that since real-time streaming is becomingmore and more popular, there are instances in which reproduction of theaudio may be socially inappropriate depending on the user's environment.Accordingly, as an initial value, a configuration in which only videodata is reproduced, i.e., the audio signal is not reproduced, ispreferable. Audio may be synchronized and reproduced only when an input,such as when the user clicks video data, is received.

Although smartphone ex115 was used in the above example, threeimplementations are conceivable: a transceiver terminal including bothan encoder and a decoder; a transmitter terminal including only anencoder; and a receiver terminal including only a decoder. Further, inthe description of the digital broadcasting system, an example is givenin which multiplexed data obtained as a result of video data beingmultiplexed with, for example, audio data, is received or transmitted,but the multiplexed data may be video data multiplexed with data otherthan audio data, such as text data related to the video. Moreover, thevideo data itself rather than multiplexed data maybe received ortransmitted.

Although main controller ex460 including a CPU is described ascontrolling the encoding or decoding processes, terminals often includeGPUs. Accordingly, a configuration is acceptable in which a large areais processed at once by making use of the performance ability of the GPUvia memory shared by the CPU and GPU or memory including an address thatis managed so as to allow common usage by the CPU and GPU. This makes itpossible to shorten encoding time, maintain the real-time nature of thestream, and reduce delay. In particular, processing relating to motionestimation, deblocking filtering, sample adaptive offset (SAO), andtransformation/quantization can be effectively carried out by the GPUinstead of the CPU in units of, for example pictures, all at once.

INDUSTRIAL APPLICABILITY

The present disclosure is applicable to, for example, televisionreceivers, digital video recorders, car navigation systems, mobilephones, digital cameras, digital video cameras, teleconferencingsystems, electronic mirrors, etc.

1-10. (canceled)
 11. An encoder, comprising: circuitry; and memory,wherein, using the memory, the circuitry: prohibits a first splittingmethod in response to arrangement and shapes of blocks obtained bysplitting a first block multiple times by the first splitting method areidentical to arrangement and shapes of blocks obtained by splitting thefirst block multiple times by a second splitting method different fromthe first splitting method, and in response to scan order of the blocksobtained by the first splitting method is identical to scan order of theblocks obtained by the second splitting method; and encodes the firstblock.
 12. The encoder according to claim 11, wherein the firstsplitting method prohibited is a splitting method of verticallysplitting, in response to the first block is horizontally split into twoblocks and an upper block of the two blocks is further vertically splitinto other two blocks, a lower block of the two blocks into two blocks.13. The encoder according to claim 11, wherein the circuitry avoidsencoding a signal for specifying the first splitting method prohibited.14. The encoder according to claim 13, wherein the signal specifies adirection along which, in response to the first block is horizontallysplit into two blocks and an upper block of the two blocks is furthervertically split into other two blocks, a lower block of the two blocksis split.
 15. A decoder, comprising: circuitry; and memory, wherein,using the memory, the circuitry: prohibits a first splitting method inresponse to arrangement and shapes of blocks obtained by splitting afirst block multiple times by the first splitting method are identicalto arrangement and shapes of blocks obtained by splitting the firstblock multiple times by a second splitting method different from thefirst splitting method, and in response to scan order of the blocksobtained by the first splitting method is identical to scan order of theblocks obtained by the second splitting method; and decodes the firstblock.
 16. The decoder according to claim 15, wherein the firstsplitting method prohibited is a splitting method of verticallysplitting, in response to the first block is horizontally split into twoblocks and an upper block of the two blocks is further vertically splitinto other two blocks, a lower block of the two blocks into two blocks.17. The decoder according to claim 15, wherein the circuitry avoidsdecoding a signal for specifying the first splitting method prohibitedfrom a bitstream.
 18. The decoder according to claim 17, wherein thesignal specifies a direction along which, in response to the first blockis horizontally split into two blocks and an upper block of the twoblocks is further vertically split into other two blocks, a lower blockof the two blocks is split.
 19. An encoding method, comprising:prohibiting a first splitting method in response to arrangement andshapes of blocks obtained by splitting a first block multiple times bythe first splitting method are identical to arrangement and shapes ofblocks obtained by splitting the first block multiple times by a secondsplitting method different from the first splitting method, and inresponse to scan order of the blocks obtained by the first splittingmethod is identical to scan order of the blocks obtained by the secondsplitting method; and encoding the first block.
 20. A decoding method,comprising: prohibiting a first splitting method in response toarrangement and shapes of blocks obtained by splitting a first blockmultiple times by the first splitting method are identical toarrangement and shapes of blocks obtained by splitting the first blockmultiple times by a second splitting method different from the firstsplitting method, and in response to scan order of the blocks obtainedby the first splitting method is identical to scan order of the blocksobtained by the second splitting method; and decoding the first block.